/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.eq_sdp_v2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 09:39:58,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 09:39:58,465 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-26 09:39:58,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 09:39:58,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 09:39:58,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 09:39:58,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 09:39:58,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 09:39:58,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 09:39:58,496 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 09:39:58,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 09:39:58,497 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 09:39:58,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 09:39:58,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 09:39:58,498 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 09:39:58,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 09:39:58,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 09:39:58,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 09:39:58,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 09:39:58,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 09:39:58,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 09:39:58,500 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-26 09:39:58,500 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-26 09:39:58,500 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 09:39:58,500 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-26 09:39:58,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 09:39:58,501 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 09:39:58,501 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 09:39:58,501 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 09:39:58,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 09:39:58,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 09:39:58,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 09:39:58,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 09:39:58,502 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 09:39:58,502 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 09:39:58,502 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-26 09:39:58,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-26 09:39:58,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 09:39:58,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 09:39:58,503 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 09:39:58,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 09:39:58,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 09:39:58,503 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-26 09:39:58,503 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-26 09:39:58,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 09:39:58,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 09:39:58,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 09:39:58,712 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 09:39:58,713 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 09:39:58,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v2.c [2023-12-26 09:39:59,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 09:39:59,905 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 09:39:59,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v2.c [2023-12-26 09:39:59,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51e5dc63/1c42a94c7b3c4aa294f50937e3dd39be/FLAG03d8315a3 [2023-12-26 09:39:59,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a51e5dc63/1c42a94c7b3c4aa294f50937e3dd39be [2023-12-26 09:39:59,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 09:39:59,923 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 09:39:59,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 09:39:59,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 09:39:59,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 09:39:59,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:39:59" (1/1) ... [2023-12-26 09:39:59,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45037f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:39:59, skipping insertion in model container [2023-12-26 09:39:59,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:39:59" (1/1) ... [2023-12-26 09:39:59,954 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 09:40:00,056 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.eq_sdp_v2.c[1249,1262] [2023-12-26 09:40:00,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 09:40:00,127 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 09:40:00,135 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.eq_sdp_v2.c[1249,1262] [2023-12-26 09:40:00,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 09:40:00,191 INFO L206 MainTranslator]: Completed translation [2023-12-26 09:40:00,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00 WrapperNode [2023-12-26 09:40:00,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 09:40:00,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 09:40:00,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 09:40:00,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 09:40:00,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,232 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 249 [2023-12-26 09:40:00,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 09:40:00,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 09:40:00,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 09:40:00,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 09:40:00,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,270 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-26 09:40:00,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 09:40:00,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 09:40:00,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 09:40:00,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 09:40:00,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (1/1) ... [2023-12-26 09:40:00,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 09:40:00,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 09:40:00,330 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-26 09:40:00,337 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-26 09:40:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 09:40:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-26 09:40:00,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 09:40:00,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 09:40:00,467 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 09:40:00,469 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 09:40:00,726 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 09:40:00,765 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 09:40:00,765 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 09:40:00,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:40:00 BoogieIcfgContainer [2023-12-26 09:40:00,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 09:40:00,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 09:40:00,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 09:40:00,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 09:40:00,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:39:59" (1/3) ... [2023-12-26 09:40:00,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db807a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:40:00, skipping insertion in model container [2023-12-26 09:40:00,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:40:00" (2/3) ... [2023-12-26 09:40:00,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db807a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:40:00, skipping insertion in model container [2023-12-26 09:40:00,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:40:00" (3/3) ... [2023-12-26 09:40:00,773 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v2.c [2023-12-26 09:40:00,786 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 09:40:00,786 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 09:40:00,823 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 09:40:00,828 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;@54f2d4ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 09:40:00,828 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 09:40:00,840 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-26 09:40:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-26 09:40:00,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:40:00,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-26 09:40:00,855 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:40:00,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:40:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-26 09:40:00,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:40:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385363572] [2023-12-26 09:40:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 09:40:00,871 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-26 09:40:00,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:40:00,873 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-26 09:40:00,881 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-26 09:40:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 09:40:00,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-26 09:40:00,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:40:01,118 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-26 09:40:01,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 09:40:01,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:40:01,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385363572] [2023-12-26 09:40:01,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385363572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 09:40:01,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 09:40:01,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-26 09:40:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092038195] [2023-12-26 09:40:01,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 09:40:01,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-26 09:40:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:40:01,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-26 09:40:01,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-26 09:40:01,156 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-26 09:40:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:40:01,209 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-26 09:40:01,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-26 09:40:01,211 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-26 09:40:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:40:01,215 INFO L225 Difference]: With dead ends: 16 [2023-12-26 09:40:01,216 INFO L226 Difference]: Without dead ends: 9 [2023-12-26 09:40:01,219 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-26 09:40:01,222 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-26 09:40:01,224 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-26 09:40:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-26 09:40:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-26 09:40:01,245 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-26 09:40:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-26 09:40:01,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-26 09:40:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:40:01,247 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-26 09:40:01,247 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-26 09:40:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-26 09:40:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-26 09:40:01,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:40:01,248 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-26 09:40:01,264 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-26 09:40:01,450 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-26 09:40:01,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:40:01,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:40:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-26 09:40:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:40:01,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012497697] [2023-12-26 09:40:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 09:40:01,455 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-26 09:40:01,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:40:01,457 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-26 09:40:01,486 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-26 09:40:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 09:40:01,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-26 09:40:01,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:40:01,907 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-26 09:40:01,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:40:02,541 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-26 09:40:02,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:40:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012497697] [2023-12-26 09:40:02,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012497697] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 09:40:02,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 09:40:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 09:40:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184343613] [2023-12-26 09:40:02,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 09:40:02,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 09:40:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:40:02,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 09:40:02,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-26 09:40:02,547 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-26 09:40:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:40:02,671 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-26 09:40:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-26 09:40:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-26 09:40:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:40:02,672 INFO L225 Difference]: With dead ends: 14 [2023-12-26 09:40:02,672 INFO L226 Difference]: Without dead ends: 12 [2023-12-26 09:40:02,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-26 09:40:02,675 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-26 09:40:02,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-26 09:40:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-26 09:40:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-26 09:40:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-26 09:40:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-26 09:40:02,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-26 09:40:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:40:02,681 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-26 09:40:02,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-26 09:40:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-26 09:40:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-26 09:40:02,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:40:02,682 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-26 09:40:02,688 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 (3)] Forceful destruction successful, exit code 0 [2023-12-26 09:40:02,885 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-26 09:40:02,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:40:02,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:40:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-26 09:40:02,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:40:02,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537022239] [2023-12-26 09:40:02,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 09:40:02,887 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-26 09:40:02,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:40:02,896 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-26 09:40:02,898 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-26 09:40:03,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 09:40:03,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 09:40:03,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-26 09:40:03,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:40:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 09:40:03,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:40:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 09:40:07,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:40:07,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537022239] [2023-12-26 09:40:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537022239] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 09:40:07,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 09:40:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 09:40:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756961049] [2023-12-26 09:40:07,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 09:40:07,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 09:40:07,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:40:07,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 09:40:07,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-26 09:40:07,034 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-26 09:40:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:40:07,261 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-12-26 09:40:07,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-26 09:40:07,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 10 [2023-12-26 09:40:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:40:07,262 INFO L225 Difference]: With dead ends: 17 [2023-12-26 09:40:07,262 INFO L226 Difference]: Without dead ends: 15 [2023-12-26 09:40:07,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-12-26 09:40:07,264 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-26 09:40:07,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-26 09:40:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-26 09:40:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-26 09:40:07,269 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-26 09:40:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-26 09:40:07,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2023-12-26 09:40:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:40:07,270 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-26 09:40:07,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-26 09:40:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-26 09:40:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-26 09:40:07,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 09:40:07,271 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-26 09:40:07,287 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 (4)] Forceful destruction successful, exit code 0 [2023-12-26 09:40:07,476 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-26 09:40:07,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 09:40:07,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 09:40:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 3 times [2023-12-26 09:40:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 09:40:07,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864651794] [2023-12-26 09:40:07,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-26 09:40:07,478 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-26 09:40:07,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 09:40:07,479 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-26 09:40:07,490 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-26 09:40:07,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-26 09:40:07,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 09:40:07,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 134 conjunts are in the unsatisfiable core [2023-12-26 09:40:07,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 09:40:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 09:40:09,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 09:40:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 09:40:18,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 09:40:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864651794] [2023-12-26 09:40:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864651794] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 09:40:18,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 09:40:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-26 09:40:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909601990] [2023-12-26 09:40:18,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 09:40:18,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-26 09:40:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 09:40:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-26 09:40:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-12-26 09:40:18,436 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-26 09:40:20,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 09:40:22,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 09:40:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 09:40:22,689 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-26 09:40:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-26 09:40:22,690 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-26 09:40:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 09:40:22,690 INFO L225 Difference]: With dead ends: 14 [2023-12-26 09:40:22,690 INFO L226 Difference]: Without dead ends: 0 [2023-12-26 09:40:22,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-26 09:40:22,691 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 5 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-26 09:40:22,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 0 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-26 09:40:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-26 09:40:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-26 09:40:22,692 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-26 09:40:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-26 09:40:22,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2023-12-26 09:40:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 09:40:22,692 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-26 09:40:22,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 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-26 09:40:22,692 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-26 09:40:22,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-26 09:40:22,694 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-26 09:40:22,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 (5)] Ended with exit code 0 [2023-12-26 09:40:22,895 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-26 09:40:22,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-26 09:40:29,694 WARN L293 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 247 DAG size of output: 185 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-26 09:40:29,697 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-26 09:40:29,697 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2023-12-26 09:40:29,697 INFO L899 garLoopResultBuilder]: For program point L21-1(line 21) no Hoare annotation was computed. [2023-12-26 09:40:29,697 INFO L899 garLoopResultBuilder]: For program point L21-3(line 21) no Hoare annotation was computed. [2023-12-26 09:40:29,698 INFO L895 garLoopResultBuilder]: At program point L77-2(lines 77 226) the Hoare annotation is: (let ((.cse0 (= (_ bv1 8) |ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse1 (= (_ bv1 8) |ULTIMATE.start_main_~var_17~0#1|)) (.cse15 (= (_ bv0 8) |ULTIMATE.start_main_~state_27~0#1|)) (.cse25 (= |ULTIMATE.start_main_~var_9~0#1| (_ bv0 8)))) (or (and .cse0 .cse1 (or (exists ((|ULTIMATE.start_main_~var_43_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_43_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_46_arg_1~0#1| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) |ULTIMATE.start_main_~var_46_arg_1~0#1|)) (.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_1~0#1|)) (.cse3 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_0~0#1|))) (and (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse2))) |ULTIMATE.start_main_~state_31~0#1|) (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 .cse4))))))))))))) |ULTIMATE.start_main_~state_40~0#1|) (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse4)) ((_ zero_extend 24) ((_ extract 7 0) .cse3)))))))) |ULTIMATE.start_main_~state_35~0#1|)))) (exists ((|ULTIMATE.start_main_~var_43_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_43_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_46_arg_1~0#1| (_ BitVec 8))) (let ((.cse5 ((_ zero_extend 24) |ULTIMATE.start_main_~var_46_arg_1~0#1|)) (.cse7 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_1~0#1|)) (.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_0~0#1|))) (and (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse5))) |ULTIMATE.start_main_~state_31~0#1|) (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse5) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 .cse7))))))))))))) |ULTIMATE.start_main_~state_40~0#1|) (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse7)) ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))))) |ULTIMATE.start_main_~state_35~0#1|))))) (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet20#1_27| (_ BitVec 8))) (let ((.cse8 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet20#1_27|) (_ bv1 32))))) (and (not (= .cse8 (_ bv0 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) .cse8))) (_ bv1 32))) |ULTIMATE.start_main_~state_27~0#1|)))) (or (exists ((|ULTIMATE.start_main_~var_46_arg_1~0#1| (_ BitVec 8))) (let ((.cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~var_46_arg_1~0#1|))) (and (= ((_ extract 7 0) .cse9) |ULTIMATE.start_main_~state_25~0#1|) (exists ((|ULTIMATE.start_main_~var_43_arg_0~0#1| (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_0~0#1|))) (and (exists ((|ULTIMATE.start_main_~var_43_arg_1~0#1| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_1~0#1|))) (and (= ((_ extract 7 0) .cse10) |ULTIMATE.start_main_~state_23~0#1|) (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse9) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse10))))))))))) |ULTIMATE.start_main_~state_38~0#1|)))) (= ((_ extract 7 0) .cse11) |ULTIMATE.start_main_~state_21~0#1|))))))) (exists ((|ULTIMATE.start_main_~var_46_arg_1~0#1| (_ BitVec 8))) (let ((.cse14 ((_ zero_extend 24) |ULTIMATE.start_main_~var_46_arg_1~0#1|))) (and (exists ((|ULTIMATE.start_main_~var_43_arg_0~0#1| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_0~0#1|))) (and (= ((_ extract 7 0) .cse12) |ULTIMATE.start_main_~state_21~0#1|) (exists ((|ULTIMATE.start_main_~var_43_arg_1~0#1| (_ BitVec 8))) (let ((.cse13 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_1~0#1|))) (and (= ((_ extract 7 0) .cse13) |ULTIMATE.start_main_~state_23~0#1|) (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse12 .cse13))))))))))) |ULTIMATE.start_main_~state_38~0#1|))))))) (= ((_ extract 7 0) .cse14) |ULTIMATE.start_main_~state_25~0#1|)))))) (and .cse15 (exists ((|ULTIMATE.start_main_~var_43_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_46_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_43_arg_0~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_0~0#1|)) (.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_1~0#1|)) (.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~var_46_arg_1~0#1|))) (and (= ((_ extract 7 0) .cse16) |ULTIMATE.start_main_~state_23~0#1|) (= ((_ extract 7 0) .cse17) |ULTIMATE.start_main_~state_21~0#1|) (= ((_ extract 7 0) .cse18) |ULTIMATE.start_main_~state_25~0#1|) (= ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse17 (bvneg .cse16)))))) .cse18)))))) |ULTIMATE.start_main_~state_38~0#1|))))) (and .cse15 (exists ((|ULTIMATE.start_main_~var_43_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_43_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_46_arg_1~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_1~0#1|)) (.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_0~0#1|)) (.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~var_46_arg_1~0#1|))) (and (= |ULTIMATE.start_main_~state_38~0#1| ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse19) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 (bvneg .cse21))))))))))))) (= ((_ extract 7 0) .cse21) |ULTIMATE.start_main_~state_23~0#1|) (= ((_ extract 7 0) .cse20) |ULTIMATE.start_main_~state_21~0#1|) (= ((_ extract 7 0) .cse19) |ULTIMATE.start_main_~state_25~0#1|)))))) (exists ((|ULTIMATE.start_main_~var_43_arg_1~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_43_arg_0~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~var_46_arg_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_0~0#1|)) (.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~var_43_arg_1~0#1|)) (.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~var_46_arg_1~0#1|))) (and (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse22)) (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse23)))))))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse24))))))))))) (_ bv1 32))) |ULTIMATE.start_main_~state_12~0#1|) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 (bvneg .cse23)))))) .cse24))))))))))) (_ bv1 32))) |ULTIMATE.start_main_~state_10~0#1|)))) .cse25 (exists ((|v_ULTIMATE.start_main_#t~nondet20#1_27| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet20#1_27|) (_ bv1 32))) |ULTIMATE.start_main_~input_6~0#1|)) (exists ((|v_ULTIMATE.start_main_#t~nondet22#1_29| (_ BitVec 8))) (= |ULTIMATE.start_main_~input_8~0#1| ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet22#1_29|) (_ bv1 32)))))) (and (= (_ bv0 8) |ULTIMATE.start_main_~state_21~0#1|) .cse0 (= (_ bv0 8) |ULTIMATE.start_main_~state_10~0#1|) .cse1 .cse15 (= (_ bv0 8) |ULTIMATE.start_main_~state_31~0#1|) (= (_ bv0 8) |ULTIMATE.start_main_~state_29~0#1|) (= (_ bv0 8) |ULTIMATE.start_main_~state_25~0#1|) (= (_ bv0 8) |ULTIMATE.start_main_~state_40~0#1|) (= (_ bv0 8) |ULTIMATE.start_main_~state_35~0#1|) (= (_ bv0 8) |ULTIMATE.start_main_~state_38~0#1|) (= (_ bv0 8) |ULTIMATE.start_main_~state_12~0#1|) .cse25 (= (_ bv0 8) |ULTIMATE.start_main_~state_33~0#1|) (= (_ bv0 8) |ULTIMATE.start_main_~state_23~0#1|)))) [2023-12-26 09:40:29,698 INFO L899 garLoopResultBuilder]: For program point L77-3(lines 77 226) no Hoare annotation was computed. [2023-12-26 09:40:29,698 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-26 09:40:29,698 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2023-12-26 09:40:29,700 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-26 09:40:29,701 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-26 09:40:29,718 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: (~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0])[7:0] == ~state_31~0 && ~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1))[7:0])[7:0]))[7:0])[7:0])[7:0])[7:0] == ~state_40~0) && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0]), ~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0]))[7:0])[7:0])[7:0] == ~state_35~0) could not be translated [2023-12-26 09:40:29,718 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: (~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0])[7:0] == ~state_31~0 && ~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1))[7:0])[7:0]))[7:0])[7:0])[7:0])[7:0] == ~state_40~0) && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0]), ~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0]))[7:0])[7:0])[7:0] == ~state_35~0) could not be translated [2023-12-26 09:40:29,719 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_#t~nondet20#1_27 : bv8 :: !(~bvand~32(~zero_extend~32~8(v_ULTIMATE.start_main_#t~nondet20#1_27), 1bv32)[7:0] == 0bv8) && ~bvand~32(~zero_extend~32~8(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_ULTIMATE.start_main_#t~nondet20#1_27), 1bv32)[7:0])[7:0]), 1bv32)[7:0] == ~state_27~0) could not be translated [2023-12-26 09:40:29,719 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0] == ~state_25~0 && (exists ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8 :: (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8 :: ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0] == ~state_23~0 && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1))[7:0])[7:0]))[7:0])[7:0])[7:0] == ~state_38~0) && ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0] == ~state_21~0)) could not be translated [2023-12-26 09:40:29,719 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: (exists ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8 :: ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0] == ~state_21~0 && (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8 :: ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0] == ~state_23~0 && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1))[7:0])[7:0]))[7:0])[7:0])[7:0] == ~state_38~0)) && ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0] == ~state_25~0) could not be translated [2023-12-26 09:40:29,719 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8 :: ((~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0] == ~state_23~0 && ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0] == ~state_21~0) && ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0] == ~state_25~0) && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)))[7:0])[7:0]), ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1))[7:0])[7:0])[7:0] == ~state_38~0) could not be translated [2023-12-26 09:40:29,724 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: ((~state_38~0 == ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)))[7:0])[7:0]))[7:0])[7:0])[7:0] && ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0] == ~state_23~0) && ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0] == ~state_21~0) && ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0] == ~state_25~0) could not be translated [2023-12-26 09:40:29,724 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: ~bvand~32(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0]), ~bvneg~32(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0])))[7:0])[7:0])[7:0]), ~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0])[7:0]))[7:0])[7:0])[7:0]), 1bv32)[7:0] == ~state_12~0 && ~bvand~32(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)))[7:0])[7:0]), ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1))[7:0])[7:0])[7:0])[7:0])[7:0]), 1bv32)[7:0] == ~state_10~0) could not be translated [2023-12-26 09:40:29,724 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_#t~nondet20#1_27 : bv8 :: ~bvand~32(~zero_extend~32~8(v_ULTIMATE.start_main_#t~nondet20#1_27), 1bv32)[7:0] == ~input_6~0) could not be translated [2023-12-26 09:40:29,724 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_#t~nondet22#1_29 : bv8 :: ~input_8~0 == ~bvand~32(~zero_extend~32~8(v_ULTIMATE.start_main_#t~nondet22#1_29), 1bv32)[7:0]) could not be translated [2023-12-26 09:40:29,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:40:29 BoogieIcfgContainer [2023-12-26 09:40:29,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-26 09:40:29,727 INFO L158 Benchmark]: Toolchain (without parser) took 29804.21ms. Allocated memory was 287.3MB in the beginning and 987.8MB in the end (delta: 700.4MB). Free memory was 236.8MB in the beginning and 655.3MB in the end (delta: -418.5MB). Peak memory consumption was 283.0MB. Max. memory is 8.0GB. [2023-12-26 09:40:29,727 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 09:40:29,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.26ms. Allocated memory is still 287.3MB. Free memory was 236.5MB in the beginning and 221.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-26 09:40:29,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.49ms. Allocated memory is still 287.3MB. Free memory was 220.8MB in the beginning and 218.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-26 09:40:29,727 INFO L158 Benchmark]: Boogie Preprocessor took 58.81ms. Allocated memory is still 287.3MB. Free memory was 218.1MB in the beginning and 215.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-26 09:40:29,728 INFO L158 Benchmark]: RCFGBuilder took 472.79ms. Allocated memory is still 287.3MB. Free memory was 215.0MB in the beginning and 241.3MB in the end (delta: -26.3MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2023-12-26 09:40:29,728 INFO L158 Benchmark]: TraceAbstraction took 28958.48ms. Allocated memory was 287.3MB in the beginning and 987.8MB in the end (delta: 700.4MB). Free memory was 240.8MB in the beginning and 655.3MB in the end (delta: -414.5MB). Peak memory consumption was 285.5MB. Max. memory is 8.0GB. [2023-12-26 09:40:29,729 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 202.4MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.26ms. Allocated memory is still 287.3MB. Free memory was 236.5MB in the beginning and 221.1MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.49ms. Allocated memory is still 287.3MB. Free memory was 220.8MB in the beginning and 218.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.81ms. Allocated memory is still 287.3MB. Free memory was 218.1MB in the beginning and 215.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 472.79ms. Allocated memory is still 287.3MB. Free memory was 215.0MB in the beginning and 241.3MB in the end (delta: -26.3MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * TraceAbstraction took 28958.48ms. Allocated memory was 287.3MB in the beginning and 987.8MB in the end (delta: 700.4MB). Free memory was 240.8MB in the beginning and 655.3MB in the end (delta: -414.5MB). Peak memory consumption was 285.5MB. 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_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: (~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0])[7:0] == ~state_31~0 && ~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1))[7:0])[7:0]))[7:0])[7:0])[7:0])[7:0] == ~state_40~0) && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0]), ~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0]))[7:0])[7:0])[7:0] == ~state_35~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: (~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0])[7:0] == ~state_31~0 && ~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1))[7:0])[7:0]))[7:0])[7:0])[7:0])[7:0] == ~state_40~0) && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0]), ~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0]))[7:0])[7:0])[7:0] == ~state_35~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_#t~nondet20#1_27 : bv8 :: !(~bvand~32(~zero_extend~32~8(v_ULTIMATE.start_main_#t~nondet20#1_27), 1bv32)[7:0] == 0bv8) && ~bvand~32(~zero_extend~32~8(~zero_extend~32~8(~bvand~32(~zero_extend~32~8(v_ULTIMATE.start_main_#t~nondet20#1_27), 1bv32)[7:0])[7:0]), 1bv32)[7:0] == ~state_27~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0] == ~state_25~0 && (exists ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8 :: (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8 :: ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0] == ~state_23~0 && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1))[7:0])[7:0]))[7:0])[7:0])[7:0] == ~state_38~0) && ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0] == ~state_21~0)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: (exists ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8 :: ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0] == ~state_21~0 && (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8 :: ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0] == ~state_23~0 && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1))[7:0])[7:0]))[7:0])[7:0])[7:0] == ~state_38~0)) && ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0] == ~state_25~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8 :: ((~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0] == ~state_23~0 && ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0] == ~state_21~0) && ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0] == ~state_25~0) && ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)))[7:0])[7:0]), ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1))[7:0])[7:0])[7:0] == ~state_38~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: ((~state_38~0 == ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)), ~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)))[7:0])[7:0]))[7:0])[7:0])[7:0] && ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0] == ~state_23~0) && ~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0] == ~state_21~0) && ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0] == ~state_25~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists ULTIMATE.start_main_~var_43_arg_1~0#1 : bv8, ULTIMATE.start_main_~var_43_arg_0~0#1 : bv8, ULTIMATE.start_main_~var_46_arg_1~0#1 : bv8 :: ~bvand~32(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1)[7:0]), ~bvneg~32(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)[7:0])))[7:0])[7:0])[7:0]), ~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1)[7:0])[7:0]))[7:0])[7:0])[7:0]), 1bv32)[7:0] == ~state_12~0 && ~bvand~32(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(~zero_extend~32~8(~bvadd~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_0~0#1), ~bvneg~32(~zero_extend~32~8(ULTIMATE.start_main_~var_43_arg_1~0#1)))[7:0])[7:0]), ~zero_extend~32~8(ULTIMATE.start_main_~var_46_arg_1~0#1))[7:0])[7:0])[7:0])[7:0])[7:0]), 1bv32)[7:0] == ~state_10~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_#t~nondet20#1_27 : bv8 :: ~bvand~32(~zero_extend~32~8(v_ULTIMATE.start_main_#t~nondet20#1_27), 1bv32)[7:0] == ~input_6~0) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_main_#t~nondet22#1_29 : bv8 :: ~input_8~0 == ~bvand~32(~zero_extend~32~8(v_ULTIMATE.start_main_#t~nondet22#1_29), 1bv32)[7: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: 28.9s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 6 mSDtfsCounter, 68 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 25, 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, 5 NumberOfFragments, 421 HoareAnnotationTreeSize, 1 FormulaSimplifications, 1394 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 1058 FormulaSimplificationTreeSizeReductionInter, 6.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 32 QuantifiedInterpolants, 27872 SizeOfPredicates, 256 NumberOfNonLiveVariables, 1022 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 3/48 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: 77]: Loop Invariant Derived loop invariant: ((((1 == mask_SORT_1) && (1 == var_17)) && (var_9 == 0)) || (((((((((((((((0 == state_21) && (1 == mask_SORT_1)) && (0 == state_10)) && (1 == var_17)) && (0 == state_27)) && (0 == state_31)) && (0 == state_29)) && (0 == state_25)) && (0 == state_40)) && (0 == state_35)) && (0 == state_38)) && (0 == state_12)) && (var_9 == 0)) && (0 == state_33)) && (0 == state_23))) RESULT: Ultimate proved your program to be correct! [2023-12-26 09:40:29,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...