/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 07:24:39,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 07:24:39,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-06 07:24:39,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 07:24:39,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 07:24:39,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 07:24:39,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 07:24:39,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 07:24:39,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 07:24:39,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 07:24:39,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 07:24:39,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 07:24:39,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 07:24:39,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 07:24:39,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 07:24:39,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 07:24:39,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 07:24:39,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 07:24:39,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 07:24:39,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 07:24:39,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 07:24:39,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 07:24:39,455 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 07:24:39,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 07:24:39,455 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 07:24:39,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 07:24:39,456 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 07:24:39,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 07:24:39,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 07:24:39,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 07:24:39,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 07:24:39,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 07:24:39,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 07:24:39,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 07:24:39,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 07:24:39,458 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 07:24:39,458 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 07:24:39,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 07:24:39,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 07:24:39,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 07:24:39,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 07:24:39,460 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 07:24:39,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 07:24:39,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 07:24:39,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 07:24:39,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 07:24:39,707 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 07:24:39,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c [2024-11-06 07:24:41,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 07:24:41,532 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 07:24:41,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c [2024-11-06 07:24:41,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51975ef56/3ac6d05a5853430f8e56f0e1b2d1da70/FLAGb21e73689 [2024-11-06 07:24:41,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51975ef56/3ac6d05a5853430f8e56f0e1b2d1da70 [2024-11-06 07:24:41,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 07:24:41,865 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 07:24:41,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 07:24:41,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 07:24:41,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 07:24:41,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:24:41" (1/1) ... [2024-11-06 07:24:41,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edb2963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:41, skipping insertion in model container [2024-11-06 07:24:41,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:24:41" (1/1) ... [2024-11-06 07:24:41,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 07:24:42,118 WARN L250 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.sw_state_machine.c[1256,1269] [2024-11-06 07:24:42,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 07:24:42,319 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 07:24:42,328 WARN L250 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.sw_state_machine.c[1256,1269] [2024-11-06 07:24:42,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 07:24:42,434 INFO L204 MainTranslator]: Completed translation [2024-11-06 07:24:42,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42 WrapperNode [2024-11-06 07:24:42,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 07:24:42,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 07:24:42,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 07:24:42,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 07:24:42,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,517 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 703 [2024-11-06 07:24:42,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 07:24:42,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 07:24:42,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 07:24:42,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 07:24:42,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,600 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]. [2024-11-06 07:24:42,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 07:24:42,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 07:24:42,673 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 07:24:42,673 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 07:24:42,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (1/1) ... [2024-11-06 07:24:42,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 07:24:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 07:24:42,713 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) [2024-11-06 07:24:42,721 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 [2024-11-06 07:24:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 07:24:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 07:24:42,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 07:24:42,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 07:24:42,976 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 07:24:42,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 07:24:43,630 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-06 07:24:43,630 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 07:24:43,643 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 07:24:43,643 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 07:24:43,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:24:43 BoogieIcfgContainer [2024-11-06 07:24:43,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 07:24:43,647 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 07:24:43,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 07:24:43,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 07:24:43,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:24:41" (1/3) ... [2024-11-06 07:24:43,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a10b02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:24:43, skipping insertion in model container [2024-11-06 07:24:43,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:42" (2/3) ... [2024-11-06 07:24:43,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a10b02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:24:43, skipping insertion in model container [2024-11-06 07:24:43,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:24:43" (3/3) ... [2024-11-06 07:24:43,656 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_state_machine.c [2024-11-06 07:24:43,674 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 07:24:43,675 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 07:24:43,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 07:24:43,728 INFO L333 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, 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;@68a9eefd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 07:24:43,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 07:24:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) [2024-11-06 07:24:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-06 07:24:43,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 07:24:43,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-06 07:24:43,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 07:24:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 07:24:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-06 07:24:43,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 07:24:43,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995974883] [2024-11-06 07:24:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 07:24:43,762 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 [2024-11-06 07:24:43,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 07:24:43,768 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) [2024-11-06 07:24:43,770 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 [2024-11-06 07:24:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 07:24:43,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 07:24:43,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 07:24:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 07:24:44,093 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 07:24:44,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 07:24:44,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995974883] [2024-11-06 07:24:44,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995974883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 07:24:44,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 07:24:44,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 07:24:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752302371] [2024-11-06 07:24:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 07:24:44,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 07:24:44,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 07:24:44,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 07:24:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 07:24:44,129 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-11-06 07:24:44,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 07:24:44,188 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-06 07:24:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 07:24:44,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-06 07:24:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 07:24:44,196 INFO L225 Difference]: With dead ends: 18 [2024-11-06 07:24:44,197 INFO L226 Difference]: Without dead ends: 10 [2024-11-06 07:24:44,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 07:24:44,204 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 07:24:44,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 07:24:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-06 07:24:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-06 07:24:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2024-11-06 07:24:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-06 07:24:44,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-06 07:24:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 07:24:44,233 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-06 07:24:44,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-11-06 07:24:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-06 07:24:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-06 07:24:44,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 07:24:44,234 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-06 07:24:44,239 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 [2024-11-06 07:24:44,435 WARN L453 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 [2024-11-06 07:24:44,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 07:24:44,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 07:24:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-06 07:24:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 07:24:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518052338] [2024-11-06 07:24:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 07:24:44,438 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 [2024-11-06 07:24:44,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 07:24:44,441 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) [2024-11-06 07:24:44,442 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 [2024-11-06 07:24:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 07:24:44,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-06 07:24:44,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 07:24:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 07:24:44,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 07:24:50,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_30~0#1|)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_5~0#1|))) (and (or .cse0 (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_36~0#1|)))))) (and (forall ((|v_ULTIMATE.start_main_~var_12_arg_0~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~state_16~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse3)))))) ((_ zero_extend 24) |ULTIMATE.start_main_~state_16~0#1|)))))))))))))))))))))) (forall ((|v_ULTIMATE.start_main_~var_12_arg_0~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~state_16~0#1| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) .cse3)))))) ((_ zero_extend 24) |ULTIMATE.start_main_~state_16~0#1|)))) .cse2))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_10|)))))) (_ bv0 8)))))) (or (not .cse0) (forall ((|v_ULTIMATE.start_main_~var_12_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_10|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse2)))))))))))))))))) is different from false [2024-11-06 07:24:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-06 07:24:50,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 07:24:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518052338] [2024-11-06 07:24:50,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518052338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 07:24:50,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 07:24:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-06 07:24:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982966208] [2024-11-06 07:24:50,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 07:24:50,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 07:24:50,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 07:24:50,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 07:24:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-06 07:24:50,656 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2024-11-06 07:24:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 07:24:50,824 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-06 07:24:50,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 07:24:50,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) Word has length 8 [2024-11-06 07:24:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 07:24:50,826 INFO L225 Difference]: With dead ends: 15 [2024-11-06 07:24:50,826 INFO L226 Difference]: Without dead ends: 13 [2024-11-06 07:24:50,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=31, Invalid=44, Unknown=1, NotChecked=14, Total=90 [2024-11-06 07:24:50,828 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 07:24:50,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2024-11-06 07:24:50,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-06 07:24:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-06 07:24:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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) [2024-11-06 07:24:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-06 07:24:50,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-06 07:24:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 07:24:50,832 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-06 07:24:50,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) [2024-11-06 07:24:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-06 07:24:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-06 07:24:50,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 07:24:50,833 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-06 07:24:50,838 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 [2024-11-06 07:24:51,036 WARN L453 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 [2024-11-06 07:24:51,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 07:24:51,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 07:24:51,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-06 07:24:51,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 07:24:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308628267] [2024-11-06 07:24:51,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 07:24:51,039 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 [2024-11-06 07:24:51,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 07:24:51,042 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) [2024-11-06 07:24:51,043 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 [2024-11-06 07:24:51,328 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 07:24:51,329 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 07:24:51,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-06 07:24:51,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 07:24:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 07:24:52,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 07:25:06,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse48 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_14~0#1|)) (.cse31 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_16~0#1|))) (let ((.cse21 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_20~0#1|)) (.cse19 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|)) (.cse15 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse26 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_5~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_28~0#1|)) (.cse47 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse31)))) (.cse46 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse48))))) (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse24 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse31)))) (.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse47 .cse48)))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse13)))) (.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse9)))) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse26)))) (.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse15)))) (.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse19)))) (.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse21)))) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse47))))) (let ((.cse4 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse41 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_18~0#1|))) (let ((.cse42 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse41))))) (let ((.cse43 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse28))))) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse43))))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse20))))) (let ((.cse45 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse44))))) (let ((.cse39 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse16))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 .cse10))) .cse9))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 .cse13)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse40 .cse19))))))))) .cse10))) .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse28))) .cse23))))))))) .cse16))) .cse10))) .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse24)))))) .cse20)))))) .cse16)))))) .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse42)))))) .cse20)))))) .cse16))) .cse10))) .cse12))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse43))) .cse20))))))))) .cse10))) .cse12))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse44))) .cse16))) .cse10))) .cse12)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse45))) .cse10))) .cse12))))))))))))))))))))))) (.cse35 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_36~0#1|))) (let ((.cse36 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_30~0#1|)) (.cse34 ((_ zero_extend 24) ((_ extract 7 0) .cse35))) (.cse2 (not .cse4))) (and (or (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse35)))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse34))))))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse33))))))) (.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) .cse33))))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) .cse32))))))))) .cse9))))))) (let ((.cse5 (= |c_ULTIMATE.start_main_~state_18~0#1| (_ bv0 8))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse6)))))))))))))))) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse32))))))))))))))) (.cse7 (and (forall ((v_subst_1 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) v_subst_1) .cse29))) .cse6)))))))))))))))))) (forall ((v_subst_2 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) v_subst_2)))) .cse6))))))))))))))))))))) (and (or (forall ((|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse1))))))))))))))) .cse2) (or .cse3 .cse2) (or .cse4 .cse5 (and (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (v_subst_1 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)))))))))) (_ bv0 32))))))) ((_ zero_extend 24) v_subst_1)))) .cse6)))))))))))))))))) (forall ((v_subst_2 (_ BitVec 8)) (|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)))))))))) (_ bv1 32))))))) ((_ zero_extend 24) v_subst_2)))) .cse6)))))))))))))) .cse0)))))) (or (not .cse5) (let ((.cse8 (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse28))))) (let ((.cse18 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse22))))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse20))))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse14))))) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse27))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 .cse11)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse13)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse15))) .cse16))) .cse10))) .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse19)))))) .cse16))) .cse10)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse21 .cse22)))))))))))) .cse10)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse24)))))) .cse20))) .cse17))) .cse16))) .cse10)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 (_ bv255 32)))) .cse23))) .cse20))))))))) .cse10))))))))) (_ bv0 32))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 .cse27))) .cse10))) .cse12))))))))))))))))))) (_ bv0 8)))) (and (or .cse7 .cse8) (or .cse3 (not .cse8))))) (or .cse4 (and (forall ((v_subst_1 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) v_subst_1) .cse29))) .cse1)))))))))))))))))) (forall ((v_subst_2 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) v_subst_2)))) .cse1)))))))))))))))))))) (or .cse4 .cse7))))) .cse36) (or (not .cse36) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) .cse9)))) (and (or .cse4 (let ((.cse38 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse34))))) (and (forall ((v_subst_1 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) v_subst_1) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse38))))))))))))))))))))))))))) (forall ((v_subst_2 (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv1 32) .cse38)))))) ((_ zero_extend 24) v_subst_2)))))))))))))))))))) (_ bv0 8)))))) (or (forall ((|v_ULTIMATE.start_main_~var_12_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_12_arg_0~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse37))))))))))))))) .cse2)))))))))) is different from false [2024-11-06 07:25:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-06 07:25:07,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 07:25:07,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308628267] [2024-11-06 07:25:07,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308628267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 07:25:07,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 07:25:07,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-06 07:25:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370462509] [2024-11-06 07:25:07,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 07:25:07,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 07:25:07,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 07:25:07,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 07:25:07,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=48, Unknown=2, NotChecked=14, Total=90 [2024-11-06 07:25:07,883 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) [2024-11-06 07:25:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 07:25:08,504 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-06 07:25:08,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 07:25:08,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11 [2024-11-06 07:25:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 07:25:08,505 INFO L225 Difference]: With dead ends: 18 [2024-11-06 07:25:08,506 INFO L226 Difference]: Without dead ends: 16 [2024-11-06 07:25:08,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=52, Invalid=82, Unknown=2, NotChecked=20, Total=156 [2024-11-06 07:25:08,507 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 07:25:08,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 9 Unchecked, 0.2s Time] [2024-11-06 07:25:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-06 07:25:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-06 07:25:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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) [2024-11-06 07:25:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-06 07:25:08,512 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-06 07:25:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 07:25:08,512 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-06 07:25:08,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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) [2024-11-06 07:25:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-06 07:25:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-06 07:25:08,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 07:25:08,513 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-06 07:25:08,519 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 [2024-11-06 07:25:08,713 WARN L453 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 [2024-11-06 07:25:08,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 07:25:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 07:25:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-06 07:25:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 07:25:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091150143] [2024-11-06 07:25:08,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 07:25:08,716 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 [2024-11-06 07:25:08,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 07:25:08,717 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) [2024-11-06 07:25:08,718 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 [2024-11-06 07:25:09,018 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-06 07:25:09,019 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 07:25:09,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-06 07:25:09,037 INFO L278 TraceCheckSpWp]: Computing forward predicates...