/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 21:40:37,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 21:40:37,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-16 21:40:37,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 21:40:37,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 21:40:37,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 21:40:37,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 21:40:37,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 21:40:37,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 21:40:37,070 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 21:40:37,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 21:40:37,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 21:40:37,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 21:40:37,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 21:40:37,073 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 21:40:37,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 21:40:37,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 21:40:37,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 21:40:37,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 21:40:37,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 21:40:37,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 21:40:37,078 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 21:40:37,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 21:40:37,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 21:40:37,079 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 21:40:37,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 21:40:37,079 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 21:40:37,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 21:40:37,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 21:40:37,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 21:40:37,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 21:40:37,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 21:40:37,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 21:40:37,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 21:40:37,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 21:40:37,080 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 21:40:37,080 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 21:40:37,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 21:40:37,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 21:40:37,081 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 21:40:37,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 21:40:37,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 21:40:37,082 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 21:40:37,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-12-16 21:40:37,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 21:40:37,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 21:40:37,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 21:40:37,277 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 21:40:37,278 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 21:40:37,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter.c [2023-12-16 21:40:38,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 21:40:38,427 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 21:40:38,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter.c [2023-12-16 21:40:38,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b513dad/27fb080ba7724090b1496e1ca317c4d1/FLAG8d180c94b [2023-12-16 21:40:38,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b513dad/27fb080ba7724090b1496e1ca317c4d1 [2023-12-16 21:40:38,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 21:40:38,447 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 21:40:38,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 21:40:38,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 21:40:38,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 21:40:38,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1416d9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38, skipping insertion in model container [2023-12-16 21:40:38,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,473 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 21:40:38,575 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter.c[1247,1260] [2023-12-16 21:40:38,595 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 21:40:38,608 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 21:40:38,617 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.counter.c[1247,1260] [2023-12-16 21:40:38,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 21:40:38,637 INFO L206 MainTranslator]: Completed translation [2023-12-16 21:40:38,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38 WrapperNode [2023-12-16 21:40:38,638 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 21:40:38,639 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 21:40:38,639 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 21:40:38,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 21:40:38,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,663 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2023-12-16 21:40:38,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 21:40:38,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 21:40:38,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 21:40:38,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 21:40:38,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,684 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 21:40:38,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 21:40:38,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 21:40:38,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 21:40:38,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 21:40:38,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (1/1) ... [2023-12-16 21:40:38,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 21:40:38,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 21:40:38,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 21:40:38,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 21:40:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 21:40:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 21:40:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 21:40:38,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 21:40:38,883 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 21:40:38,885 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 21:40:38,997 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 21:40:39,018 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 21:40:39,018 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 21:40:39,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:40:39 BoogieIcfgContainer [2023-12-16 21:40:39,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 21:40:39,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 21:40:39,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 21:40:39,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 21:40:39,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:40:38" (1/3) ... [2023-12-16 21:40:39,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200408d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:40:39, skipping insertion in model container [2023-12-16 21:40:39,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:40:38" (2/3) ... [2023-12-16 21:40:39,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200408d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:40:39, skipping insertion in model container [2023-12-16 21:40:39,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:40:39" (3/3) ... [2023-12-16 21:40:39,025 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.counter.c [2023-12-16 21:40:39,039 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 21:40:39,039 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 21:40:39,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 21:40:39,081 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@101bc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 21:40:39,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 21:40:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:40:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-16 21:40:39,088 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:40:39,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-16 21:40:39,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:40:39,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:40:39,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-16 21:40:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:40:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089906996] [2023-12-16 21:40:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 21:40:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:40:39,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:40:39,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 21:40:39,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 21:40:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 21:40:39,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 21:40:39,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:40:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:39,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 21:40:39,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:40:39,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089906996] [2023-12-16 21:40:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089906996] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 21:40:39,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 21:40:39,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 21:40:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42088702] [2023-12-16 21:40:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 21:40:39,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 21:40:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:40:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 21:40:39,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 21:40:39,427 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:40:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:40:39,471 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-16 21:40:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 21:40:39,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-16 21:40:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:40:39,478 INFO L225 Difference]: With dead ends: 16 [2023-12-16 21:40:39,478 INFO L226 Difference]: Without dead ends: 9 [2023-12-16 21:40:39,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 21:40:39,483 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 21:40:39,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 21:40:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-16 21:40:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-16 21:40:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:40:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-16 21:40:39,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-16 21:40:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:40:39,505 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-16 21:40:39,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:40:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-16 21:40:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 21:40:39,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:40:39,505 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-16 21:40:39,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 21:40:39,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:40:39,712 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:40:39,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:40:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-16 21:40:39,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:40:39,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329068265] [2023-12-16 21:40:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 21:40:39,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:40:39,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:40:39,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 21:40:39,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 21:40:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 21:40:39,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-16 21:40:39,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:40:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:40,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 21:40:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:40,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:40:40,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329068265] [2023-12-16 21:40:40,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329068265] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 21:40:40,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 21:40:40,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 21:40:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687074897] [2023-12-16 21:40:40,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 21:40:40,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 21:40:40,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:40:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 21:40:40,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 21:40:40,499 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:40:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:40:40,708 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-16 21:40:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 21:40:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-16 21:40:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:40:40,709 INFO L225 Difference]: With dead ends: 17 [2023-12-16 21:40:40,709 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 21:40:40,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2023-12-16 21:40:40,710 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 21:40:40,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 21:40:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 21:40:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-16 21:40:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:40:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-16 21:40:40,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-12-16 21:40:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:40:40,715 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-16 21:40:40,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:40:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-16 21:40:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 21:40:40,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:40:40,716 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-16 21:40:40,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 21:40:40,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:40:40,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:40:40,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:40:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 2 times [2023-12-16 21:40:40,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:40:40,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100575374] [2023-12-16 21:40:40,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 21:40:40,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:40:40,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:40:40,937 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 21:40:40,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 21:40:41,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 21:40:41,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 21:40:41,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-16 21:40:41,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:40:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:41,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 21:40:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 21:40:53,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:40:53,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100575374] [2023-12-16 21:40:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100575374] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 21:40:53,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 21:40:53,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 21:40:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28547484] [2023-12-16 21:40:53,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 21:40:53,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 21:40:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:40:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 21:40:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=88, Unknown=1, NotChecked=0, Total=132 [2023-12-16 21:40:53,388 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:40:57,527 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse88 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse91 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse88)))))) (.cse35 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|))) (let ((.cse93 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse60 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse35))))))) .cse12)) (.cse90 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse91)))))) (.cse29 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_18~0#1|))) (let ((.cse39 (= .cse91 .cse29)) (.cse87 (= .cse90 .cse12)) (.cse50 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse98 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_15|)))))))))) (or (not (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse98))))))) (not (= .cse29 .cse98)))))) (.cse25 (not .cse60)) (.cse63 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_15| (_ BitVec 8))) (not (= .cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_15|)))))))))))) (.cse30 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse97 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_15|)))))))))) (or (= .cse29 .cse97) (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse97 .cse35))))))))))))))) (.cse55 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse96 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_15|)))))))))) (or (not (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse96 .cse35)))))))))))) (= .cse29 .cse96))))) (.cse61 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse95 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_15|)))))))))) (or (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse95)))))) (= .cse29 .cse95))))) (.cse89 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse90))))) .cse12)) (.cse33 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse94 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_15|)))))))))) (or (not (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse94))))))) (= .cse29 .cse94))))) (.cse11 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_15| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse93 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_15|) (_ bv255 32)))))) (_ bv0 8)))) (.cse10 (forall ((|v_ULTIMATE.start_main_~var_14_arg_0~0#1_15| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse93 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_14_arg_0~0#1_15|) (_ bv254 32)))))) (_ bv0 8)))) (.cse54 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_15| (_ BitVec 8))) (let ((.cse92 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_15|)))))))))) (or (not (= .cse29 .cse92)) (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse92)))))))))) (.cse79 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse88 .cse35))))))))))) (.cse77 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse91 .cse35)))))))))))) (let ((.cse81 (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse77)) .cse28))))) (.cse82 (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse77 .cse35)))))))))))) (.cse80 (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse90 .cse35))))))) .cse28))))) (.cse8 (= .cse79 .cse29)) (.cse17 (or .cse10 .cse54)) (.cse18 (or .cse33 .cse11)) (.cse40 (or .cse10 .cse89)) (.cse19 (or .cse61 .cse10)) (.cse20 (or .cse55 .cse11)) (.cse42 (or (not .cse89) .cse11)) (.cse21 (or .cse10 .cse30)) (.cse22 (or .cse60 .cse63 .cse10)) (.cse23 (or .cse63 .cse11 .cse25)) (.cse24 (or .cse11 .cse50)) (.cse0 (= .cse29 .cse88)) (.cse85 (or .cse87 .cse10)) (.cse4 (or .cse60 .cse10)) (.cse6 (or .cse11 .cse25)) (.cse86 (or .cse11 (not .cse87))) (.cse83 (not .cse39))) (let ((.cse1 (or (and .cse85 .cse4 .cse6 .cse86) .cse83)) (.cse7 (or (let ((.cse84 (= .cse12 .cse77))) (and (or .cse10 .cse84) .cse85 (or .cse11 (not .cse84)) .cse86)) .cse39)) (.cse16 (not .cse0)) (.cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse79 .cse35))))))))))) (.cse51 (or (and .cse17 .cse18 .cse40 .cse19 .cse20 .cse42 .cse4 .cse21 .cse6 .cse22 .cse23 .cse24) .cse83)) (.cse2 (not .cse8)) (.cse43 (or .cse80 .cse10)) (.cse46 (or .cse82 .cse10)) (.cse47 (or (not .cse82) .cse11)) (.cse41 (or .cse11 (not .cse81))) (.cse44 (or .cse10 .cse81)) (.cse45 (or .cse11 (not .cse80))) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse79))))))) (and (or .cse0 (let ((.cse14 (= .cse12 .cse15))) (let ((.cse3 (or .cse11 (not .cse14))) (.cse5 (or .cse14 .cse10))) (and .cse1 (or .cse2 (and .cse3 .cse4 .cse5 .cse6)) .cse7 (or .cse8 (let ((.cse9 (= .cse12 .cse13))) (and .cse3 .cse5 (or .cse9 .cse10) (or .cse11 (not .cse9))))))))) (or (= (_ bv2 8) |c_ULTIMATE.start_main_~state_6~0#1|) (= (_ bv1 8) |c_ULTIMATE.start_main_~state_6~0#1|) (= (_ bv4 8) |c_ULTIMATE.start_main_~state_6~0#1|) (= |c_ULTIMATE.start_main_~state_6~0#1| (_ bv3 8))) (or .cse16 (and .cse17 .cse1 .cse18 .cse19 .cse7 .cse20 .cse21 .cse22 .cse23 .cse24)) (or .cse16 (let ((.cse26 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse67 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse67)))))))))) .cse29)) (= .cse29 .cse67))))) (.cse31 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (not (= .cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|))))))))))))) (and (or .cse11 .cse25 .cse26) (or .cse11 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse27)) .cse28))))) .cse28))) .cse12)) (not (= .cse29 .cse27)))))) (or .cse10 .cse30 .cse31) (or .cse10 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) .cse28))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse32)) .cse28))) .cse12) (= .cse29 .cse32))))) (or .cse33 .cse11 .cse31) (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse36 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (let ((.cse34 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse36)))))))))))) (or (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse35))))))))))) (= .cse29 .cse36) (= .cse34 .cse29))))) .cse10) (or .cse11 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse37)))))))))))) (or (= .cse29 .cse37) (= .cse38 .cse29) (not (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse38)))))))))))) (or .cse39 (and .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47)) (or .cse11 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse49 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (let ((.cse48 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse49)))))))))))) (or (not (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse48 .cse35)))))))))))) (= .cse29 .cse49) (= .cse48 .cse29)))))) (or .cse11 .cse31 .cse50) .cse51 (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse53 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (let ((.cse52 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse53)))))))))))) (or (not (= .cse52 .cse29)) (= .cse29 .cse53) (not (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse52))))))))))) .cse11) (or .cse10 .cse54 .cse31) (or .cse55 .cse11 .cse31) (or .cse10 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (let ((.cse56 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse57)))))))))))) (or (not (= .cse56 .cse29)) (= .cse29 .cse57) (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse56))))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (let ((.cse59 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse58)))))))))))) (or (= .cse29 .cse58) (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse59)))))) (= .cse59 .cse29))))) .cse10) (or .cse60 .cse10 .cse26) (or .cse11 .cse31 .cse25) (or .cse61 .cse10 .cse31) (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse62 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse62)) .cse28))))) .cse28))) .cse12) (not (= .cse29 .cse62))))) .cse10) (or .cse60 .cse10 .cse31) (or .cse60 .cse63 .cse10 .cse31) (or .cse11 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) .cse28))))) (or (= .cse29 .cse64) (not (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse64 .cse35)))))))))))))))) (or (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse65 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) .cse28))))) (or (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse65 .cse35))))))))))) (= .cse29 .cse65)))) .cse10) (or .cse63 .cse11 .cse31 .cse25) (or .cse11 (forall ((|v_ULTIMATE.start_main_~var_20_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_1~0#1_16|)))))))))) .cse28))))) (or (= .cse29 .cse66) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse66)) .cse28))) .cse12))))))))) (= |c_ULTIMATE.start_main_~var_8~0#1| (_ bv0 8)) (= (_ bv1 8) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|) (or (let ((.cse78 (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse15)))))))) (let ((.cse72 (or .cse10 .cse78)) (.cse74 (or (not .cse78) .cse11))) (and (or .cse8 (let ((.cse75 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) .cse13))))) .cse12))) (let ((.cse71 (= .cse29 .cse13)) (.cse69 (or .cse10 .cse75)) (.cse70 (or .cse11 (not .cse75))) (.cse73 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse35)))))))))) .cse12))) (and (or (let ((.cse68 (= .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse35 .cse13))))))))))))) (and (or .cse10 .cse68) .cse69 .cse70 (or .cse11 (not .cse68)))) .cse71) (or (not .cse71) (and .cse4 .cse6 .cse69 .cse70)) .cse72 (or .cse11 (not .cse73)) (or .cse10 .cse73) .cse74)))) .cse51 (or (and .cse17 .cse18 .cse19 .cse20 .cse4 .cse72 .cse21 .cse6 .cse22 .cse23 .cse24 .cse74) .cse2) (or .cse39 (let ((.cse76 (= .cse29 .cse77))) (and .cse40 .cse42 .cse43 (or (and .cse41 .cse44 .cse46 .cse47) .cse76) (or (and .cse41 .cse4 .cse6 .cse44) (not .cse76)) .cse45)))))) .cse0)))))))) is different from false [2023-12-16 21:41:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:41:03,284 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-16 21:41:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 21:41:03,285 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-16 21:41:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:41:03,286 INFO L225 Difference]: With dead ends: 29 [2023-12-16 21:41:03,286 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 21:41:03,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=146, Invalid=275, Unknown=3, NotChecked=38, Total=462 [2023-12-16 21:41:03,289 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 21:41:03,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 16 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 6 Unchecked, 0.4s Time] [2023-12-16 21:41:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 21:41:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-16 21:41:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:41:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-12-16 21:41:03,310 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2023-12-16 21:41:03,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:41:03,310 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-12-16 21:41:03,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:41:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-12-16 21:41:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 21:41:03,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 21:41:03,311 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2023-12-16 21:41:03,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 21:41:03,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:41:03,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 21:41:03,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 21:41:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash 284396189, now seen corresponding path program 3 times [2023-12-16 21:41:03,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 21:41:03,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000803889] [2023-12-16 21:41:03,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 21:41:03,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:41:03,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 21:41:03,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 21:41:03,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 21:41:03,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 21:41:03,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 21:41:03,601 WARN L260 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-16 21:41:03,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 21:41:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-16 21:41:04,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 21:41:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-16 21:41:09,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 21:41:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000803889] [2023-12-16 21:41:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000803889] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 21:41:09,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 21:41:09,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-12-16 21:41:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680828923] [2023-12-16 21:41:09,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 21:41:09,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 21:41:09,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 21:41:09,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 21:41:09,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-16 21:41:09,308 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:41:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 21:41:09,374 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2023-12-16 21:41:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 21:41:09,375 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-16 21:41:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 21:41:09,375 INFO L225 Difference]: With dead ends: 26 [2023-12-16 21:41:09,377 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 21:41:09,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-12-16 21:41:09,382 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 21:41:09,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 0 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 21:41:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 21:41:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 21:41:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:41:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 21:41:09,384 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2023-12-16 21:41:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 21:41:09,384 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 21:41:09,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 21:41:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 21:41:09,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 21:41:09,388 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 21:41:09,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 21:41:09,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 21:41:09,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 21:41:10,011 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 21:41:10,011 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-12-16 21:41:10,012 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-12-16 21:41:10,012 INFO L899 garLoopResultBuilder]: For program point L21-3(line 21) no Hoare annotation was computed. [2023-12-16 21:41:10,013 INFO L895 garLoopResultBuilder]: At program point L44-2(lines 44 81) the Hoare annotation is: (and (= (_ bv1 8) |ULTIMATE.start_main_~mask_SORT_1~0#1|) (= (_ bv1 8) |ULTIMATE.start_main_~var_5~0#1|) (not (= ((_ zero_extend 24) |ULTIMATE.start_main_~state_6~0#1|) (_ bv0 32))) (= |ULTIMATE.start_main_~var_8~0#1| (_ bv0 8)) (= (_ bv15 8) |ULTIMATE.start_main_~mask_SORT_4~0#1|) (= (_ bv15 8) |ULTIMATE.start_main_~var_18~0#1|) (= (_ bv1 8) |ULTIMATE.start_main_~var_12~0#1|) (exists ((|ULTIMATE.start_main_~var_21_arg_1~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand (_ bv15 32) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~var_21_arg_1~0#1|))))) |ULTIMATE.start_main_~state_6~0#1|))) [2023-12-16 21:41:10,013 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 21:41:10,013 INFO L899 garLoopResultBuilder]: For program point L44-3(lines 44 81) no Hoare annotation was computed. [2023-12-16 21:41:10,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-12-16 21:41:10,015 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-16 21:41:10,017 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 21:41:10,027 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_21_arg_1~0#1 : bv8 :: ~bvand~32(15bv32, ~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_21_arg_1~0#1)[7:0]))[7:0] == ~state_6~0) could not be translated [2023-12-16 21:41:10,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:41:10 BoogieIcfgContainer [2023-12-16 21:41:10,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 21:41:10,029 INFO L158 Benchmark]: Toolchain (without parser) took 31582.54ms. Allocated memory was 343.9MB in the beginning and 597.7MB in the end (delta: 253.8MB). Free memory was 301.5MB in the beginning and 523.0MB in the end (delta: -221.5MB). Peak memory consumption was 351.4MB. Max. memory is 8.0GB. [2023-12-16 21:41:10,029 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 243.3MB. Free memory is still 190.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 21:41:10,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.69ms. Allocated memory is still 343.9MB. Free memory was 301.5MB in the beginning and 289.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 21:41:10,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.83ms. Allocated memory is still 343.9MB. Free memory was 289.1MB in the beginning and 287.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 21:41:10,030 INFO L158 Benchmark]: Boogie Preprocessor took 29.35ms. Allocated memory is still 343.9MB. Free memory was 287.6MB in the beginning and 285.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 21:41:10,030 INFO L158 Benchmark]: RCFGBuilder took 323.01ms. Allocated memory is still 343.9MB. Free memory was 285.6MB in the beginning and 272.3MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 21:41:10,031 INFO L158 Benchmark]: TraceAbstraction took 31008.37ms. Allocated memory was 343.9MB in the beginning and 597.7MB in the end (delta: 253.8MB). Free memory was 271.6MB in the beginning and 523.0MB in the end (delta: -251.4MB). Peak memory consumption was 322.0MB. Max. memory is 8.0GB. [2023-12-16 21:41:10,032 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 243.3MB. Free memory is still 190.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.69ms. Allocated memory is still 343.9MB. Free memory was 301.5MB in the beginning and 289.1MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.83ms. Allocated memory is still 343.9MB. Free memory was 289.1MB in the beginning and 287.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.35ms. Allocated memory is still 343.9MB. Free memory was 287.6MB in the beginning and 285.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 323.01ms. Allocated memory is still 343.9MB. Free memory was 285.6MB in the beginning and 272.3MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 31008.37ms. Allocated memory was 343.9MB in the beginning and 597.7MB in the end (delta: 253.8MB). Free memory was 271.6MB in the beginning and 523.0MB in the end (delta: -251.4MB). Peak memory consumption was 322.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_21_arg_1~0#1 : bv8 :: ~bvand~32(15bv32, ~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_21_arg_1~0#1)[7:0]))[7:0] == ~state_6~0) could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 6 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 9 NumberOfFragments, 34 HoareAnnotationTreeSize, 1 FormulaSimplifications, 5842 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 1 FormulaSimplificationsInter, 2998 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 49 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 40 QuantifiedInterpolants, 46165 SizeOfPredicates, 155 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 96/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((((((1 == mask_SORT_1) && (1 == var_5)) && !((state_6 == 0))) && (var_8 == 0)) && (15 == mask_SORT_4)) && (15 == var_18)) && (1 == var_12)) RESULT: Ultimate proved your program to be correct! [2023-12-16 21:41:10,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...