/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.needham.1.prop1-func-interl.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 13:20:27,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 13:20:27,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-26 13:20:27,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 13:20:27,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 13:20:27,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 13:20:27,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 13:20:27,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 13:20:27,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 13:20:27,649 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 13:20:27,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 13:20:27,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 13:20:27,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 13:20:27,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 13:20:27,651 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 13:20:27,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 13:20:27,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 13:20:27,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 13:20:27,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 13:20:27,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 13:20:27,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 13:20:27,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-26 13:20:27,653 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-26 13:20:27,653 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 13:20:27,653 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-26 13:20:27,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 13:20:27,653 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 13:20:27,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 13:20:27,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 13:20:27,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 13:20:27,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 13:20:27,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 13:20:27,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 13:20:27,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 13:20:27,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 13:20:27,655 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-26 13:20:27,655 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-26 13:20:27,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 13:20:27,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 13:20:27,656 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 13:20:27,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 13:20:27,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 13:20:27,656 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-26 13:20:27,656 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-26 13:20:27,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 13:20:27,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 13:20:27,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 13:20:27,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 13:20:27,855 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 13:20:27,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.needham.1.prop1-func-interl.c [2023-12-26 13:20:28,843 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 13:20:29,111 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 13:20:29,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.needham.1.prop1-func-interl.c [2023-12-26 13:20:29,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ad28ff7/b47b1af6a65c4573844ea831a48a7ed0/FLAGee6e2ba21 [2023-12-26 13:20:29,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ad28ff7/b47b1af6a65c4573844ea831a48a7ed0 [2023-12-26 13:20:29,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 13:20:29,140 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 13:20:29,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 13:20:29,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 13:20:29,146 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 13:20:29,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:29,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24638000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29, skipping insertion in model container [2023-12-26 13:20:29,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:29,198 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 13:20:29,317 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.needham.1.prop1-func-interl.c[1174,1187] [2023-12-26 13:20:29,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 13:20:29,681 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 13:20:29,694 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.needham.1.prop1-func-interl.c[1174,1187] [2023-12-26 13:20:29,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 13:20:29,792 INFO L206 MainTranslator]: Completed translation [2023-12-26 13:20:29,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29 WrapperNode [2023-12-26 13:20:29,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 13:20:29,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 13:20:29,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 13:20:29,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 13:20:29,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:29,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:29,919 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2790 [2023-12-26 13:20:29,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 13:20:29,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 13:20:29,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 13:20:29,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 13:20:29,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:29,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:29,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:29,996 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-26 13:20:29,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:29,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:30,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:30,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:30,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:30,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:30,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 13:20:30,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 13:20:30,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 13:20:30,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 13:20:30,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (1/1) ... [2023-12-26 13:20:30,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 13:20:30,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 13:20:30,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-26 13:20:30,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-26 13:20:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 13:20:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-26 13:20:30,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 13:20:30,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 13:20:30,570 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 13:20:30,572 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 13:20:34,839 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 13:20:34,922 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 13:20:34,922 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 13:20:34,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 01:20:34 BoogieIcfgContainer [2023-12-26 13:20:34,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 13:20:34,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 13:20:34,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 13:20:34,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 13:20:34,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 01:20:29" (1/3) ... [2023-12-26 13:20:34,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2288a2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 01:20:34, skipping insertion in model container [2023-12-26 13:20:34,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 01:20:29" (2/3) ... [2023-12-26 13:20:34,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2288a2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 01:20:34, skipping insertion in model container [2023-12-26 13:20:34,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 01:20:34" (3/3) ... [2023-12-26 13:20:34,928 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.needham.1.prop1-func-interl.c [2023-12-26 13:20:34,940 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 13:20:34,940 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 13:20:34,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 13:20:34,981 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e9126a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 13:20:34,981 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 13:20:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:20:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-26 13:20:34,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 13:20:34,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-26 13:20:34,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 13:20:34,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 13:20:34,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-26 13:20:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 13:20:35,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426979936] [2023-12-26 13:20:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 13:20:35,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:20:35,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 13:20:35,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 13:20:35,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-26 13:20:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 13:20:35,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-26 13:20:35,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 13:20:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 13:20:35,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 13:20:35,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 13:20:35,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426979936] [2023-12-26 13:20:35,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426979936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 13:20:35,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 13:20:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-26 13:20:35,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082518022] [2023-12-26 13:20:35,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 13:20:35,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-26 13:20:35,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 13:20:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-26 13:20:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-26 13:20:35,586 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:20:37,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-26 13:20:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 13:20:38,136 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-26 13:20:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-26 13:20:38,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-26 13:20:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 13:20:38,143 INFO L225 Difference]: With dead ends: 16 [2023-12-26 13:20:38,143 INFO L226 Difference]: Without dead ends: 9 [2023-12-26 13:20:38,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-26 13:20:38,147 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-26 13:20:38,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-26 13:20:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-26 13:20:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-26 13:20:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:20:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-26 13:20:38,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-26 13:20:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 13:20:38,167 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-26 13:20:38,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:20:38,167 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-26 13:20:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-26 13:20:38,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 13:20:38,167 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-26 13:20:38,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-26 13:20:38,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:20:38,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 13:20:38,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 13:20:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-26 13:20:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 13:20:38,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242935033] [2023-12-26 13:20:38,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 13:20:38,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:20:38,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 13:20:38,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 13:20:38,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-26 13:20:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 13:20:42,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 2301 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-26 13:20:42,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 13:20:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 13:20:43,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 13:20:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 13:20:43,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 13:20:43,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242935033] [2023-12-26 13:20:43,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242935033] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 13:20:43,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 13:20:43,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-26 13:20:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278860680] [2023-12-26 13:20:43,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 13:20:43,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-26 13:20:43,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 13:20:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-26 13:20:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-26 13:20:43,713 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:20:47,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:20:49,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:20:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 13:20:49,675 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-26 13:20:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-26 13:20:49,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-26 13:20:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 13:20:49,675 INFO L225 Difference]: With dead ends: 14 [2023-12-26 13:20:49,676 INFO L226 Difference]: Without dead ends: 12 [2023-12-26 13:20:49,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-26 13:20:49,677 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-26 13:20:49,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 9 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-26 13:20:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-26 13:20:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2023-12-26 13:20:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:20:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-26 13:20:49,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-26 13:20:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 13:20:49,680 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-26 13:20:49,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:20:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-26 13:20:49,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-26 13:20:49,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 13:20:49,681 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2023-12-26 13:20:49,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-26 13:20:49,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:20:49,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 13:20:49,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 13:20:49,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2112524529, now seen corresponding path program 2 times [2023-12-26 13:20:49,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 13:20:49,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339196418] [2023-12-26 13:20:49,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 13:20:49,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:20:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 13:20:49,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 13:20:49,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-26 13:20:57,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 13:20:57,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 13:20:57,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 4426 conjuncts, 171 conjunts are in the unsatisfiable core [2023-12-26 13:20:57,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 13:21:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 13:21:03,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 13:21:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 13:21:07,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 13:21:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339196418] [2023-12-26 13:21:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339196418] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 13:21:07,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 13:21:07,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 13:21:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744223924] [2023-12-26 13:21:07,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 13:21:07,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 13:21:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 13:21:07,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 13:21:07,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2023-12-26 13:21:07,980 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:21:14,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:21:26,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:21:35,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:21:36,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:21:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 13:21:36,505 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-12-26 13:21:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-26 13:21:36,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-26 13:21:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 13:21:36,506 INFO L225 Difference]: With dead ends: 17 [2023-12-26 13:21:36,506 INFO L226 Difference]: Without dead ends: 15 [2023-12-26 13:21:36,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=68, Invalid=140, Unknown=2, NotChecked=0, Total=210 [2023-12-26 13:21:36,512 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-12-26 13:21:36,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 13.4s Time] [2023-12-26 13:21:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-26 13:21:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-26 13:21:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:21:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-26 13:21:36,521 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2023-12-26 13:21:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 13:21:36,521 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-26 13:21:36,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:21:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-26 13:21:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-26 13:21:36,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 13:21:36,522 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-26 13:21:36,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-26 13:21:36,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:21:36,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 13:21:36,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 13:21:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 3 times [2023-12-26 13:21:36,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 13:21:36,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356559761] [2023-12-26 13:21:36,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-26 13:21:36,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:21:36,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 13:21:36,742 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 13:21:36,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-26 13:21:56,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-26 13:21:56,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 13:21:57,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 6551 conjuncts, 778 conjunts are in the unsatisfiable core [2023-12-26 13:21:57,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 13:23:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 13:23:08,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 13:25:07,057 WARN L293 SmtUtils]: Spent 10.73s on a formula simplification that was a NOOP. DAG size: 1944 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 13:25:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 13:25:15,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 13:25:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356559761] [2023-12-26 13:25:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356559761] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 13:25:15,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 13:25:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-26 13:25:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137190385] [2023-12-26 13:25:15,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 13:25:15,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-26 13:25:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 13:25:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-26 13:25:15,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=182, Unknown=16, NotChecked=0, Total=240 [2023-12-26 13:25:15,315 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:25:30,525 WARN L293 SmtUtils]: Spent 11.37s on a formula simplification. DAG size of input: 2281 DAG size of output: 2267 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 13:25:49,461 WARN L293 SmtUtils]: Spent 11.92s on a formula simplification. DAG size of input: 2290 DAG size of output: 2269 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 13:25:52,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:25:57,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:25:59,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:26:33,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:26:35,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:26:56,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:27:12,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:27:17,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:27:19,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:28:00,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:28:51,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:28:55,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:28:59,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:29:05,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:29:35,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:29:37,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 13:29:42,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-26 13:29:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 13:29:43,212 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2023-12-26 13:29:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-26 13:29:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-26 13:29:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 13:29:43,213 INFO L225 Difference]: With dead ends: 20 [2023-12-26 13:29:43,213 INFO L226 Difference]: Without dead ends: 18 [2023-12-26 13:29:43,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 367.9s TimeCoverageRelationStatistics Valid=129, Invalid=350, Unknown=27, NotChecked=0, Total=506 [2023-12-26 13:29:43,214 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.9s IncrementalHoareTripleChecker+Time [2023-12-26 13:29:43,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 18 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 10 Unknown, 0 Unchecked, 66.9s Time] [2023-12-26 13:29:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-26 13:29:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2023-12-26 13:29:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:29:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-12-26 13:29:43,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2023-12-26 13:29:43,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 13:29:43,231 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-12-26 13:29:43,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 13:29:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-12-26 13:29:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-26 13:29:43,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 13:29:43,232 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2023-12-26 13:29:43,330 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 (5)] Forceful destruction successful, exit code 0 [2023-12-26 13:29:43,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:29:43,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 13:29:43,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 13:29:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash -310375345, now seen corresponding path program 4 times [2023-12-26 13:29:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 13:29:43,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239737637] [2023-12-26 13:29:43,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-26 13:29:43,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 [2023-12-26 13:29:43,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 13:29:43,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-26 13:29:43,440 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 (6)] Waiting until timeout for monitored process [2023-12-26 13:30:01,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-26 13:30:01,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 13:30:01,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 8676 conjuncts, 1063 conjunts are in the unsatisfiable core [2023-12-26 13:30:01,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 13:31:15,716 WARN L293 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 2658 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 13:31:50,958 WARN L293 SmtUtils]: Spent 16.29s on a formula simplification that was a NOOP. DAG size: 2686 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-26 13:34:59,532 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-26 13:34:59,533 WARN L340 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 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-26 13:34:59,680 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-26 13:34:59,828 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 (6)] Forceful destruction successful, exit code 0 [2023-12-26 13:34:59,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 13:34:59,905 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 17 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ∧-2-1 context. [2023-12-26 13:34:59,908 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-12-26 13:34:59,910 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-26 13:34:59,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 01:34:59 BoogieIcfgContainer [2023-12-26 13:34:59,911 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-26 13:34:59,911 INFO L158 Benchmark]: Toolchain (without parser) took 870771.50ms. Allocated memory was 191.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 143.7MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-12-26 13:34:59,912 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 13:34:59,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.53ms. Allocated memory is still 191.9MB. Free memory was 143.7MB in the beginning and 118.7MB in the end (delta: 25.0MB). Peak memory consumption was 45.0MB. Max. memory is 8.0GB. [2023-12-26 13:34:59,912 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.56ms. Allocated memory is still 191.9MB. Free memory was 118.7MB in the beginning and 98.4MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-26 13:34:59,912 INFO L158 Benchmark]: Boogie Preprocessor took 165.10ms. Allocated memory is still 191.9MB. Free memory was 98.4MB in the beginning and 73.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-26 13:34:59,912 INFO L158 Benchmark]: RCFGBuilder took 4836.19ms. Allocated memory was 191.9MB in the beginning and 394.3MB in the end (delta: 202.4MB). Free memory was 73.2MB in the beginning and 306.0MB in the end (delta: -232.9MB). Peak memory consumption was 169.9MB. Max. memory is 8.0GB. [2023-12-26 13:34:59,913 INFO L158 Benchmark]: TraceAbstraction took 864987.18ms. Allocated memory was 394.3MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 305.5MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-26 13:34:59,914 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 191.9MB. Free memory is still 149.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 651.53ms. Allocated memory is still 191.9MB. Free memory was 143.7MB in the beginning and 118.7MB in the end (delta: 25.0MB). Peak memory consumption was 45.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 126.56ms. Allocated memory is still 191.9MB. Free memory was 118.7MB in the beginning and 98.4MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 165.10ms. Allocated memory is still 191.9MB. Free memory was 98.4MB in the beginning and 73.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * RCFGBuilder took 4836.19ms. Allocated memory was 191.9MB in the beginning and 394.3MB in the end (delta: 202.4MB). Free memory was 73.2MB in the beginning and 306.0MB in the end (delta: -232.9MB). Peak memory consumption was 169.9MB. Max. memory is 8.0GB. * TraceAbstraction took 864987.18ms. Allocated memory was 394.3MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 305.5MB in the beginning and 1.6GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while NwaCegarLoop was analyzing trace of length 17 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-7-1 term,while PolyPacSimplificationTermWalker was simplifying 7 xjuncts wrt. a ∧-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 864.9s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 305.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 88.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 87.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 8 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 392.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=4, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 30.6s SatisfiabilityAnalysisTime, 209.7s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 32 QuantifiedInterpolants, 98314 SizeOfPredicates, 1268 NumberOfNonLiveVariables, 13454 ConjunctsInSsa, 1013 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown