/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 --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_analog_estimation_convergence.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 18:05:35,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 18:05:35,862 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-01 18:05:35,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 18:05:35,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 18:05:35,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 18:05:35,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 18:05:35,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 18:05:35,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 18:05:35,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 18:05:35,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 18:05:35,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 18:05:35,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 18:05:35,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 18:05:35,914 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 18:05:35,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 18:05:35,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 18:05:35,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 18:05:35,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 18:05:35,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 18:05:35,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 18:05:35,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 18:05:35,924 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 18:05:35,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 18:05:35,924 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 18:05:35,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 18:05:35,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 18:05:35,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 18:05:35,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 18:05:35,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 18:05:35,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 18:05:35,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 18:05:35,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 18:05:35,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 18:05:35,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 18:05:35,929 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 18:05:35,930 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 18:05:35,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 18:05:35,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 18:05:35,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 18:05:35,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 18:05:35,931 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 18:05:35,931 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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-01 18:05:36,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 18:05:36,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 18:05:36,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 18:05:36,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 18:05:36,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 18:05:36,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_analog_estimation_convergence.c [2024-11-01 18:05:37,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 18:05:38,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 18:05:38,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.safe_analog_estimation_convergence.c [2024-11-01 18:05:38,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81518965/09a148d81023496db458cbf6689e3939/FLAGfb807e117 [2024-11-01 18:05:38,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81518965/09a148d81023496db458cbf6689e3939 [2024-11-01 18:05:38,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 18:05:38,480 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 18:05:38,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 18:05:38,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 18:05:38,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 18:05:38,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 06:05:38" (1/1) ... [2024-11-01 18:05:38,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318bc9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:38, skipping insertion in model container [2024-11-01 18:05:38,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 06:05:38" (1/1) ... [2024-11-01 18:05:38,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 18:05:38,740 WARN L251 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.safe_analog_estimation_convergence.c[1287,1300] [2024-11-01 18:05:38,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 18:05:38,923 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 18:05:38,934 WARN L251 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.safe_analog_estimation_convergence.c[1287,1300] [2024-11-01 18:05:38,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 18:05:39,013 INFO L204 MainTranslator]: Completed translation [2024-11-01 18:05:39,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39 WrapperNode [2024-11-01 18:05:39,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 18:05:39,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 18:05:39,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 18:05:39,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 18:05:39,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,104 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 427 [2024-11-01 18:05:39,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 18:05:39,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 18:05:39,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 18:05:39,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 18:05:39,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,158 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-01 18:05:39,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 18:05:39,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 18:05:39,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 18:05:39,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 18:05:39,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (1/1) ... [2024-11-01 18:05:39,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 18:05:39,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 18:05:39,236 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-01 18:05:39,247 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-01 18:05:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 18:05:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 18:05:39,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-01 18:05:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-01 18:05:39,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 18:05:39,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 18:05:39,432 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 18:05:39,434 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 18:05:39,950 INFO L? ?]: Removed 178 outVars from TransFormulas that were not future-live. [2024-11-01 18:05:39,951 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 18:05:39,963 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 18:05:39,964 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 18:05:39,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 06:05:39 BoogieIcfgContainer [2024-11-01 18:05:39,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 18:05:39,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 18:05:39,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 18:05:39,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 18:05:39,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 06:05:38" (1/3) ... [2024-11-01 18:05:39,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eebac6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 06:05:39, skipping insertion in model container [2024-11-01 18:05:39,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 06:05:39" (2/3) ... [2024-11-01 18:05:39,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eebac6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 06:05:39, skipping insertion in model container [2024-11-01 18:05:39,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 06:05:39" (3/3) ... [2024-11-01 18:05:39,975 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_analog_estimation_convergence.c [2024-11-01 18:05:39,988 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 18:05:39,989 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 18:05:40,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 18:05:40,048 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;@6f17836, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 18:05:40,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 18:05:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-01 18:05:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-01 18:05:40,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 18:05:40,059 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-01 18:05:40,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 18:05:40,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 18:05:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash 896107007, now seen corresponding path program 1 times [2024-11-01 18:05:40,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 18:05:40,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111768701] [2024-11-01 18:05:40,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 18:05:40,076 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-01 18:05:40,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 18:05:40,077 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-01 18:05:40,079 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-01 18:05:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 18:05:40,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-01 18:05:40,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 18:05:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-01 18:05:40,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 18:05:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-01 18:05:41,157 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 18:05:41,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111768701] [2024-11-01 18:05:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2111768701] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 18:05:41,158 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 18:05:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 18:05:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555576934] [2024-11-01 18:05:41,161 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 18:05:41,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 18:05:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 18:05:41,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 18:05:41,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 18:05:41,194 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-01 18:05:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 18:05:41,605 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2024-11-01 18:05:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-01 18:05:41,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 17 [2024-11-01 18:05:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 18:05:41,615 INFO L225 Difference]: With dead ends: 45 [2024-11-01 18:05:41,615 INFO L226 Difference]: Without dead ends: 29 [2024-11-01 18:05:41,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-01 18:05:41,626 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-01 18:05:41,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-01 18:05:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-01 18:05:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-01 18:05:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-01 18:05:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-01 18:05:41,667 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2024-11-01 18:05:41,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 18:05:41,669 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-01 18:05:41,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-01 18:05:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-01 18:05:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-01 18:05:41,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 18:05:41,673 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-01 18:05:41,679 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 (2)] Ended with exit code 0 [2024-11-01 18:05:41,876 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-01 18:05:41,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 18:05:41,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 18:05:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash 666109311, now seen corresponding path program 1 times [2024-11-01 18:05:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 18:05:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [175731684] [2024-11-01 18:05:41,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 18:05:41,879 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-01 18:05:41,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 18:05:41,880 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-01 18:05:41,882 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-01 18:05:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 18:05:42,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-01 18:05:42,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 18:05:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-01 18:05:43,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 18:05:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-01 18:05:55,879 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 18:05:55,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [175731684] [2024-11-01 18:05:55,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [175731684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 18:05:55,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 18:05:55,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-01 18:05:55,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484462488] [2024-11-01 18:05:55,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 18:05:55,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-01 18:05:55,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 18:05:55,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-01 18:05:55,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-11-01 18:05:55,884 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-01 18:06:10,373 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|))) (let ((.cse5 ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (bvand .cse9 .cse10))))) (.cse11 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_76~0#1|))) (let ((.cse3 ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_73~0#1|) ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_72~0#1|)))))) (.cse6 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse5 .cse11))))) (let ((.cse0 (bvslt .cse3 ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |c_ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse6))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~var_82_arg_1~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_79_arg_1~0#1_12| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_79_arg_1~0#1_12|)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_82_arg_1~0#1_12|)))))) (_ bv0 8)))) (.cse2 (bvslt .cse3 .cse11)) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_82_arg_1~0#1_12| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse10))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_82_arg_1~0#1_12|)))))))))) (and (or (not .cse0) .cse1) (or (not .cse2) .cse1) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 16))) (bvslt .cse3 ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse4 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_11~0#1|))) (bvand .cse4 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse5 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse4 .cse6)))))))))))) .cse7) (or .cse0 .cse7) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 16))) (not (bvslt .cse3 ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse8 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_11~0#1|))) (bvand .cse8 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse5 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse8 .cse6))))))))))))) .cse1) (or .cse2 .cse7)))))) is different from false [2024-11-01 18:06:16,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|))) (let ((.cse4 ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (bvand .cse8 .cse9)))))) (let ((.cse2 ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_73~0#1|) ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_72~0#1|)))))) (.cse5 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse4 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_76~0#1|)))))) (let ((.cse0 (bvslt .cse2 ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |c_ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse5))))) (.cse6 (forall ((|v_ULTIMATE.start_main_~var_82_arg_1~0#1_12| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse9))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_82_arg_1~0#1_12|))))))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~var_82_arg_1~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_79_arg_1~0#1_12| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_79_arg_1~0#1_12|)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_82_arg_1~0#1_12|)))))) (_ bv0 8))))) (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (or (not .cse0) .cse1) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 16))) (bvslt .cse2 ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse3 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_11~0#1|))) (bvand .cse3 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse4 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse3 .cse5)))))))))))) .cse6) (or .cse0 .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 16))) (not (bvslt .cse2 ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse7 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_11~0#1|))) (bvand .cse7 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse4 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse7 .cse5))))))))))))) .cse1)))))) is different from false [2024-11-01 18:06:22,321 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_8~0#1|))) (let ((.cse4 ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (bvand .cse8 .cse9)))))) (let ((.cse2 ((_ zero_extend 16) ((_ zero_extend 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_73~0#1|) ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_72~0#1|)))))) (.cse5 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse4 ((_ zero_extend 16) |c_ULTIMATE.start_main_~state_76~0#1|)))))) (let ((.cse0 (bvslt .cse2 ((_ zero_extend 16) ((_ extract 15 0) (bvand ((_ zero_extend 16) |c_ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse5))))) (.cse6 (forall ((|v_ULTIMATE.start_main_~var_82_arg_1~0#1_12| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) .cse9))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_82_arg_1~0#1_12|))))))))) (.cse1 (forall ((|v_ULTIMATE.start_main_~var_82_arg_1~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_79_arg_1~0#1_12| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_79_arg_1~0#1_12|)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_82_arg_1~0#1_12|)))))) (_ bv0 8))))) (and (or (not .cse0) .cse1) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 16))) (bvslt .cse2 ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse3 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_11~0#1|))) (bvand .cse3 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse4 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse3 .cse5)))))))))))) .cse6) (or .cse0 .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 16))) (not (bvslt .cse2 ((_ zero_extend 16) ((_ extract 15 0) (let ((.cse7 ((_ zero_extend 16) |ULTIMATE.start_main_~mask_SORT_11~0#1|))) (bvand .cse7 ((_ zero_extend 16) ((_ extract 15 0) (bvadd .cse4 ((_ zero_extend 16) ((_ extract 15 0) (bvand .cse7 .cse5))))))))))))) .cse1)))))) is different from false [2024-11-01 18:06:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 18:06:38,891 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2024-11-01 18:06:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-01 18:06:38,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 47 [2024-11-01 18:06:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 18:06:38,893 INFO L225 Difference]: With dead ends: 59 [2024-11-01 18:06:38,894 INFO L226 Difference]: Without dead ends: 57 [2024-11-01 18:06:38,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=89, Invalid=159, Unknown=4, NotChecked=90, Total=342 [2024-11-01 18:06:38,895 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-11-01 18:06:38,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 96 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 62 Unchecked, 9.6s Time] [2024-11-01 18:06:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-01 18:06:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-11-01 18:06:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-01 18:06:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2024-11-01 18:06:38,914 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 47 [2024-11-01 18:06:38,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 18:06:38,914 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2024-11-01 18:06:38,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-01 18:06:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2024-11-01 18:06:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-01 18:06:38,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 18:06:38,918 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1] [2024-11-01 18:06:38,935 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-01 18:06:39,119 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-01 18:06:39,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 18:06:39,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 18:06:39,120 INFO L85 PathProgramCache]: Analyzing trace with hash -761811841, now seen corresponding path program 2 times [2024-11-01 18:06:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 18:06:39,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999578693] [2024-11-01 18:06:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 18:06:39,121 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-01 18:06:39,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 18:06:39,123 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-01 18:06:39,124 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-01 18:06:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 18:06:43,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 209 conjuncts are in the unsatisfiable core [2024-11-01 18:06:43,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 18:06:59,671 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)