/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-19 22:17:30,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 22:17:30,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 22:17:30,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 22:17:30,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 22:17:30,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 22:17:30,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 22:17:30,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 22:17:30,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 22:17:30,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 22:17:30,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 22:17:30,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 22:17:30,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 22:17:30,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 22:17:30,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 22:17:30,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 22:17:30,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 22:17:30,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 22:17:30,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 22:17:30,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 22:17:30,133 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 22:17:30,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 22:17:30,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 22:17:30,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 22:17:30,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 22:17:30,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 22:17:30,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 22:17:30,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 22:17:30,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 22:17:30,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 22:17:30,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 22:17:30,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 22:17:30,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 22:17:30,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 22:17:30,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 22:17:30,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 22:17:30,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 22:17:30,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 22:17:30,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 22:17:30,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 22:17:30,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 22:17:30,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 22:17:30,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-19 22:17:30,185 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 22:17:30,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 22:17:30,186 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-19 22:17:30,186 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-19 22:17:30,187 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-19 22:17:30,187 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-19 22:17:30,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-19 22:17:30,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-19 22:17:30,188 INFO L138 SettingsManager]: * Use SBE=true [2022-03-19 22:17:30,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 22:17:30,188 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 22:17:30,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 22:17:30,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 22:17:30,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 22:17:30,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 22:17:30,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 22:17:30,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 22:17:30,190 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 22:17:30,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 22:17:30,190 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 22:17:30,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 22:17:30,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 22:17:30,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 22:17:30,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 22:17:30,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 22:17:30,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 22:17:30,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-19 22:17:30,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-19 22:17:30,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-19 22:17:30,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-19 22:17:30,191 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-19 22:17:30,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-19 22:17:30,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 22:17:30,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-19 22:17:30,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 22:17:30,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 22:17:30,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 22:17:30,430 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 22:17:30,430 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 22:17:30,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-03-19 22:17:30,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9befb3894/d6dc87b7ac304b1ead88f90f55ee86d6/FLAG069b588cd [2022-03-19 22:17:30,770 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 22:17:30,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-03-19 22:17:30,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9befb3894/d6dc87b7ac304b1ead88f90f55ee86d6/FLAG069b588cd [2022-03-19 22:17:31,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9befb3894/d6dc87b7ac304b1ead88f90f55ee86d6 [2022-03-19 22:17:31,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 22:17:31,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 22:17:31,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 22:17:31,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 22:17:31,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 22:17:31,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c11c555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31, skipping insertion in model container [2022-03-19 22:17:31,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 22:17:31,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 22:17:31,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c[322,335] [2022-03-19 22:17:31,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 22:17:31,364 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 22:17:31,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c[322,335] [2022-03-19 22:17:31,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 22:17:31,388 INFO L208 MainTranslator]: Completed translation [2022-03-19 22:17:31,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31 WrapperNode [2022-03-19 22:17:31,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 22:17:31,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 22:17:31,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 22:17:31,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 22:17:31,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,400 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 22:17:31,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 22:17:31,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 22:17:31,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 22:17:31,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (1/1) ... [2022-03-19 22:17:31,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 22:17:31,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:17:31,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-19 22:17:31,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-19 22:17:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 22:17:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 22:17:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 22:17:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-19 22:17:31,455 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 22:17:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 22:17:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 22:17:31,455 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 22:17:31,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 22:17:31,496 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 22:17:31,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 22:17:31,584 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 22:17:31,588 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 22:17:31,588 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-19 22:17:31,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 10:17:31 BoogieIcfgContainer [2022-03-19 22:17:31,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 22:17:31,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 22:17:31,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 22:17:31,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 22:17:31,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 10:17:31" (1/3) ... [2022-03-19 22:17:31,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592ee031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 10:17:31, skipping insertion in model container [2022-03-19 22:17:31,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 10:17:31" (2/3) ... [2022-03-19 22:17:31,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592ee031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 10:17:31, skipping insertion in model container [2022-03-19 22:17:31,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 10:17:31" (3/3) ... [2022-03-19 22:17:31,605 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2022-03-19 22:17:31,609 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-19 22:17:31,609 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-19 22:17:31,660 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 22:17:31,677 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-19 22:17:31,678 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-19 22:17:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-19 22:17:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-19 22:17:31,692 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:17:31,692 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:17:31,693 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:17:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:17:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-03-19 22:17:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:17:31,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472620859] [2022-03-19 22:17:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:17:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:17:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:17:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:31,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:17:31,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472620859] [2022-03-19 22:17:31,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472620859] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:17:31,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 22:17:31,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-19 22:17:31,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809104741] [2022-03-19 22:17:31,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:17:31,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-19 22:17:31,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:17:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-19 22:17:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-19 22:17:31,864 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:17:31,906 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-03-19 22:17:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-19 22:17:31,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-19 22:17:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:17:31,918 INFO L225 Difference]: With dead ends: 29 [2022-03-19 22:17:31,918 INFO L226 Difference]: Without dead ends: 12 [2022-03-19 22:17:31,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-19 22:17:31,930 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:17:31,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:17:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-03-19 22:17:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-03-19 22:17:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-03-19 22:17:31,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-03-19 22:17:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:17:31,962 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-03-19 22:17:31,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-03-19 22:17:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-19 22:17:31,963 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:17:31,963 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:17:31,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 22:17:31,964 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:17:31,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:17:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-03-19 22:17:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:17:31,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238183708] [2022-03-19 22:17:31,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:17:31,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:17:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:17:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:17:32,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238183708] [2022-03-19 22:17:32,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238183708] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 22:17:32,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 22:17:32,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-19 22:17:32,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825158654] [2022-03-19 22:17:32,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 22:17:32,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-19 22:17:32,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:17:32,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-19 22:17:32,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-19 22:17:32,097 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:17:32,129 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-03-19 22:17:32,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-19 22:17:32,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-03-19 22:17:32,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:17:32,130 INFO L225 Difference]: With dead ends: 18 [2022-03-19 22:17:32,130 INFO L226 Difference]: Without dead ends: 13 [2022-03-19 22:17:32,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-19 22:17:32,131 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:17:32,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:17:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-03-19 22:17:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-03-19 22:17:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-03-19 22:17:32,134 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-03-19 22:17:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:17:32,135 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-03-19 22:17:32,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-03-19 22:17:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-19 22:17:32,135 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:17:32,135 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:17:32,136 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 22:17:32,136 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:17:32,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:17:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-03-19 22:17:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:17:32,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874665823] [2022-03-19 22:17:32,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:17:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:17:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:17:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:32,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:17:32,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874665823] [2022-03-19 22:17:32,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874665823] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:17:32,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291025780] [2022-03-19 22:17:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:17:32,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:17:32,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:17:32,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:17:32,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-19 22:17:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:32,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-19 22:17:32,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:17:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:32,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:17:32,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:32,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291025780] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:17:32,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:17:32,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-19 22:17:32,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076997716] [2022-03-19 22:17:32,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:17:32,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 22:17:32,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:17:32,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 22:17:32,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-19 22:17:32,325 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:17:32,382 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-03-19 22:17:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 22:17:32,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-03-19 22:17:32,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:17:32,383 INFO L225 Difference]: With dead ends: 21 [2022-03-19 22:17:32,383 INFO L226 Difference]: Without dead ends: 16 [2022-03-19 22:17:32,384 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-03-19 22:17:32,384 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-19 22:17:32,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-19 22:17:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-19 22:17:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-03-19 22:17:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-03-19 22:17:32,388 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-03-19 22:17:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:17:32,389 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-03-19 22:17:32,389 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-03-19 22:17:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-19 22:17:32,389 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:17:32,390 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:17:32,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-19 22:17:32,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:17:32,608 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:17:32,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:17:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 2 times [2022-03-19 22:17:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:17:32,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420625115] [2022-03-19 22:17:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:17:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:17:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:32,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:17:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:17:32,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420625115] [2022-03-19 22:17:32,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420625115] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:17:32,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614207566] [2022-03-19 22:17:32,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-19 22:17:32,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:17:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:17:32,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:17:32,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-19 22:17:32,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-19 22:17:32,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:17:32,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-19 22:17:32,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:17:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:32,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:17:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:32,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614207566] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:17:32,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:17:32,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-19 22:17:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106789119] [2022-03-19 22:17:32,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:17:32,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 22:17:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:17:32,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 22:17:32,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-03-19 22:17:32,993 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:17:33,529 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-03-19 22:17:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-19 22:17:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-03-19 22:17:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:17:33,530 INFO L225 Difference]: With dead ends: 27 [2022-03-19 22:17:33,530 INFO L226 Difference]: Without dead ends: 22 [2022-03-19 22:17:33,530 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-03-19 22:17:33,531 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:17:33,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 22:17:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-03-19 22:17:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-03-19 22:17:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-03-19 22:17:33,535 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2022-03-19 22:17:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:17:33,535 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-03-19 22:17:33,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-03-19 22:17:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-19 22:17:33,536 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:17:33,536 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:17:33,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-19 22:17:33,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-19 22:17:33,752 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:17:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:17:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 3 times [2022-03-19 22:17:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:17:33,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811362429] [2022-03-19 22:17:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:17:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:17:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:17:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:33,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:17:33,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811362429] [2022-03-19 22:17:33,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811362429] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:17:33,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251084386] [2022-03-19 22:17:33,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-19 22:17:33,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:17:33,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:17:33,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:17:33,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-19 22:17:34,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-19 22:17:34,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:17:34,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-19 22:17:34,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:17:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:34,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:17:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:34,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251084386] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:17:34,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:17:34,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-03-19 22:17:34,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211889157] [2022-03-19 22:17:34,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:17:34,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-19 22:17:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:17:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-19 22:17:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-03-19 22:17:34,306 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:17:41,078 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-03-19 22:17:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-19 22:17:41,078 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-19 22:17:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:17:41,079 INFO L225 Difference]: With dead ends: 39 [2022-03-19 22:17:41,079 INFO L226 Difference]: Without dead ends: 34 [2022-03-19 22:17:41,080 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=643, Invalid=1613, Unknown=0, NotChecked=0, Total=2256 [2022-03-19 22:17:41,080 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 22:17:41,080 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 22:17:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-19 22:17:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-03-19 22:17:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-03-19 22:17:41,086 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2022-03-19 22:17:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:17:41,086 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-03-19 22:17:41,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:17:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-03-19 22:17:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-19 22:17:41,087 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:17:41,087 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:17:41,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-19 22:17:41,287 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:17:41,287 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:17:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:17:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 4 times [2022-03-19 22:17:41,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:17:41,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396085328] [2022-03-19 22:17:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:17:41,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:17:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:41,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:17:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:17:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:17:41,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396085328] [2022-03-19 22:17:41,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396085328] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:17:41,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919588551] [2022-03-19 22:17:41,743 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-19 22:17:41,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:17:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:17:41,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:17:41,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-19 22:17:41,780 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-19 22:17:41,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:17:41,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-19 22:17:41,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:17:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:41,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:17:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:17:42,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919588551] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:17:42,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:17:42,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-03-19 22:17:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340517569] [2022-03-19 22:17:42,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:17:42,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-19 22:17:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:17:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-19 22:17:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-03-19 22:17:42,774 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:18:03,456 WARN L232 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 96 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:20:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 22:20:00,449 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2022-03-19 22:20:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-19 22:20:00,449 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-03-19 22:20:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 22:20:00,450 INFO L225 Difference]: With dead ends: 63 [2022-03-19 22:20:00,450 INFO L226 Difference]: Without dead ends: 58 [2022-03-19 22:20:00,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 138.4s TimeCoverageRelationStatistics Valid=2441, Invalid=6677, Unknown=2, NotChecked=0, Total=9120 [2022-03-19 22:20:00,453 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 22:20:00,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 22:20:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-19 22:20:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-03-19 22:20:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:20:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-03-19 22:20:00,463 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 33 [2022-03-19 22:20:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 22:20:00,463 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-03-19 22:20:00,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.12) internal successors, (56), 49 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:20:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-03-19 22:20:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-19 22:20:00,464 INFO L491 BasicCegarLoop]: Found error trace [2022-03-19 22:20:00,464 INFO L499 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 22:20:00,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-19 22:20:00,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:20:00,665 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-19 22:20:00,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 22:20:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 5 times [2022-03-19 22:20:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 22:20:00,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066796719] [2022-03-19 22:20:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 22:20:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 22:20:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:20:01,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 22:20:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 22:20:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:20:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 22:20:01,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066796719] [2022-03-19 22:20:01,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066796719] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-19 22:20:01,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026437775] [2022-03-19 22:20:01,665 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-19 22:20:01,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-19 22:20:01,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 22:20:01,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-19 22:20:01,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-19 22:20:45,830 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-03-19 22:20:45,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-19 22:20:45,849 WARN L261 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 95 conjunts are in the unsatisfiable core [2022-03-19 22:20:45,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-19 22:20:46,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:20:46,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-19 22:20:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 22:20:49,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026437775] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-19 22:20:49,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-19 22:20:49,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-03-19 22:20:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512805078] [2022-03-19 22:20:49,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-19 22:20:49,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-03-19 22:20:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-19 22:20:49,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-03-19 22:20:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-03-19 22:20:49,246 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 98 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 97 states have internal predecessors, (104), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-19 22:20:52,963 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 82 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 74 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 78 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 86) 4294967296) 268435455) (< (mod (+ c_main_~x~0 80) 4294967296) 268435455) (< (mod (+ 76 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 88 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 92 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 84 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 90 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-19 22:20:54,980 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 82 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 74 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 78 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 86) 4294967296) 268435455) (< (mod (+ c_main_~x~0 80) 4294967296) 268435455) (< (mod (+ 76 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 88 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 84 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 90 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-19 22:20:56,992 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 82 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 74 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 78 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 86) 4294967296) 268435455) (< (mod (+ c_main_~x~0 80) 4294967296) 268435455) (< (mod (+ 76 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 88 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 84 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-19 22:22:06,284 WARN L232 SmtUtils]: Spent 20.63s on a formula simplification. DAG size of input: 178 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:23:33,008 WARN L232 SmtUtils]: Spent 14.65s on a formula simplification. DAG size of input: 180 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:24:30,095 WARN L232 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 176 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:25:32,717 WARN L232 SmtUtils]: Spent 13.97s on a formula simplification. DAG size of input: 172 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:26:29,824 WARN L232 SmtUtils]: Spent 15.48s on a formula simplification. DAG size of input: 168 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:27:51,493 WARN L232 SmtUtils]: Spent 15.84s on a formula simplification. DAG size of input: 164 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:28:49,354 WARN L232 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 160 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:28:51,369 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 70 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 68 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 66 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 72 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-19 22:29:58,131 WARN L232 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 146 DAG size of output: 10 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:30:53,138 WARN L232 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 148 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:31:57,112 WARN L232 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 144 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-19 22:31:59,130 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.base| |c_old(#NULL.base)|) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 64 c_main_~x~0) 4294967296) 268435455) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false [2022-03-19 22:32:01,139 WARN L833 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 24) 4294967296) 268435455) (< (mod (+ 20 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 6 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 54) 4294967296) 268435455) (< (mod (+ 14 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 52 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 48 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 38 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 62 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 56 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 4 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 34 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 58 c_main_~x~0) 4294967296) 268435455) (< (mod c_main_~x~0 4294967296) 268435455) (< (mod (+ 30 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 18 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 40 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 28 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 32 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 42 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 2 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 44 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 16 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 60 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 8 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 26 c_main_~x~0) 4294967296) 268435455) (< (mod (+ c_main_~x~0 50) 4294967296) 268435455) (< (mod (+ 46 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 10 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 12 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 36 c_main_~x~0) 4294967296) 268435455) (< (mod (+ 22 c_main_~x~0) 4294967296) 268435455)) is different from false