/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.krebs.4.prop1-func-interl.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-26 11:25:44,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-26 11:25:44,782 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 11:25:44,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-26 11:25:44,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-26 11:25:44,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-26 11:25:44,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-26 11:25:44,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-26 11:25:44,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-26 11:25:44,799 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-26 11:25:44,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-26 11:25:44,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-26 11:25:44,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-26 11:25:44,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-26 11:25:44,800 INFO L153 SettingsManager]: * Use SBE=true [2023-12-26 11:25:44,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-26 11:25:44,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-26 11:25:44,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-26 11:25:44,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-26 11:25:44,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-26 11:25:44,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-26 11:25:44,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-26 11:25:44,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-26 11:25:44,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-26 11:25:44,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-26 11:25:44,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-26 11:25:44,803 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-26 11:25:44,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-26 11:25:44,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-26 11:25:44,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-26 11:25:44,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-26 11:25:44,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 11:25:44,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-26 11:25:44,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-26 11:25:44,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-26 11:25:44,805 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-26 11:25:44,805 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-26 11:25:44,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-26 11:25:44,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-26 11:25:44,806 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-26 11:25:44,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-26 11:25:44,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-26 11:25:44,807 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-26 11:25:44,807 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 11:25:44,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-26 11:25:44,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-26 11:25:44,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-26 11:25:44,997 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-26 11:25:44,997 INFO L274 PluginConnector]: CDTParser initialized [2023-12-26 11:25:44,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.krebs.4.prop1-func-interl.c [2023-12-26 11:25:46,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-26 11:25:46,409 INFO L384 CDTParser]: Found 1 translation units. [2023-12-26 11:25:46,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.krebs.4.prop1-func-interl.c [2023-12-26 11:25:46,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb68602e8/d0b44855772a4766b7f583191d5dc7b0/FLAGe7a83142c [2023-12-26 11:25:46,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb68602e8/d0b44855772a4766b7f583191d5dc7b0 [2023-12-26 11:25:46,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-26 11:25:46,460 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-26 11:25:46,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-26 11:25:46,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-26 11:25:46,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-26 11:25:46,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:25:46" (1/1) ... [2023-12-26 11:25:46,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0b3fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:46, skipping insertion in model container [2023-12-26 11:25:46,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:25:46" (1/1) ... [2023-12-26 11:25:46,535 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-26 11:25:46,690 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.krebs.4.prop1-func-interl.c[1172,1185] [2023-12-26 11:25:46,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 11:25:46,941 INFO L202 MainTranslator]: Completed pre-run [2023-12-26 11:25:46,949 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.krebs.4.prop1-func-interl.c[1172,1185] [2023-12-26 11:25:47,060 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-26 11:25:47,071 INFO L206 MainTranslator]: Completed translation [2023-12-26 11:25:47,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47 WrapperNode [2023-12-26 11:25:47,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-26 11:25:47,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-26 11:25:47,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-26 11:25:47,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-26 11:25:47,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,180 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1960 [2023-12-26 11:25:47,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-26 11:25:47,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-26 11:25:47,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-26 11:25:47,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-26 11:25:47,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,230 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 11:25:47,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-26 11:25:47,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-26 11:25:47,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-26 11:25:47,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-26 11:25:47,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (1/1) ... [2023-12-26 11:25:47,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-26 11:25:47,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-26 11:25:47,352 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 11:25:47,358 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 11:25:47,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-26 11:25:47,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-26 11:25:47,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-26 11:25:47,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-26 11:25:47,634 INFO L241 CfgBuilder]: Building ICFG [2023-12-26 11:25:47,636 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-26 11:25:49,257 INFO L282 CfgBuilder]: Performing block encoding [2023-12-26 11:25:49,320 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-26 11:25:49,321 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-26 11:25:49,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:25:49 BoogieIcfgContainer [2023-12-26 11:25:49,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-26 11:25:49,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-26 11:25:49,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-26 11:25:49,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-26 11:25:49,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:25:46" (1/3) ... [2023-12-26 11:25:49,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d9c4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:25:49, skipping insertion in model container [2023-12-26 11:25:49,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:25:47" (2/3) ... [2023-12-26 11:25:49,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d9c4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:25:49, skipping insertion in model container [2023-12-26 11:25:49,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:25:49" (3/3) ... [2023-12-26 11:25:49,327 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.4.prop1-func-interl.c [2023-12-26 11:25:49,339 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-26 11:25:49,339 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-26 11:25:49,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-26 11:25:49,375 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;@5a9adb77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-26 11:25:49,375 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-26 11:25:49,379 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 11:25:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-26 11:25:49,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 11:25:49,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-26 11:25:49,386 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 11:25:49,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 11:25:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1827279, now seen corresponding path program 1 times [2023-12-26 11:25:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 11:25:49,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684297247] [2023-12-26 11:25:49,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 11:25:49,402 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 11:25:49,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 11:25:49,404 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 11:25:49,416 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 11:25:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 11:25:49,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-26 11:25:49,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 11:25:49,932 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 11:25:49,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-26 11:25:49,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 11:25:49,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684297247] [2023-12-26 11:25:49,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684297247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-26 11:25:49,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-26 11:25:49,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-26 11:25:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324062720] [2023-12-26 11:25:49,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-26 11:25:49,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-26 11:25:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 11:25:49,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-26 11:25:49,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-26 11:25:49,960 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 11:25:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 11:25:50,254 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2023-12-26 11:25:50,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-26 11:25:50,256 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 11:25:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 11:25:50,261 INFO L225 Difference]: With dead ends: 16 [2023-12-26 11:25:50,261 INFO L226 Difference]: Without dead ends: 9 [2023-12-26 11:25:50,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-26 11:25:50,265 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-26 11:25:50,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-26 11:25:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-26 11:25:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-26 11:25:50,283 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 11:25:50,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-26 11:25:50,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2023-12-26 11:25:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 11:25:50,285 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-26 11:25:50,285 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 11:25:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-26 11:25:50,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-26 11:25:50,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 11:25:50,285 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-12-26 11:25:50,289 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 [2023-12-26 11:25:50,488 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 11:25:50,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 11:25:50,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 11:25:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1393329571, now seen corresponding path program 1 times [2023-12-26 11:25:50,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 11:25:50,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331706524] [2023-12-26 11:25:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-26 11:25:50,492 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 11:25:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 11:25:50,493 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 11:25:50,494 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 11:25:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-26 11:25:51,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-26 11:25:51,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 11:25:52,173 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 11:25:52,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 11:25:52,603 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 11:25:52,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 11:25:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331706524] [2023-12-26 11:25:52,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331706524] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 11:25:52,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 11:25:52,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-26 11:25:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727402861] [2023-12-26 11:25:52,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 11:25:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-26 11:25:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 11:25:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-26 11:25:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-26 11:25:52,606 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 11:25:57,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:25:58,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:25:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 11:25:59,478 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-26 11:25:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-26 11:25:59,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-26 11:25:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 11:25:59,479 INFO L225 Difference]: With dead ends: 17 [2023-12-26 11:25:59,479 INFO L226 Difference]: Without dead ends: 15 [2023-12-26 11:25:59,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-12-26 11:25:59,480 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-26 11:25:59,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2023-12-26 11:25:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-26 11:25:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-26 11:25:59,484 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 11:25:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-26 11:25:59,484 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2023-12-26 11:25:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 11:25:59,484 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-26 11:25:59,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 11:25:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-26 11:25:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-26 11:25:59,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 11:25:59,485 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2023-12-26 11:25:59,496 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 11:25:59,695 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 11:25:59,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 11:25:59,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 11:25:59,696 INFO L85 PathProgramCache]: Analyzing trace with hash -57678563, now seen corresponding path program 2 times [2023-12-26 11:25:59,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 11:25:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135271738] [2023-12-26 11:25:59,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-26 11:25:59,710 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 11:25:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 11:25:59,711 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 11:25:59,713 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 11:26:05,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-26 11:26:05,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 11:26:05,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 4705 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-26 11:26:05,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 11:26:06,896 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 11:26:06,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 11:26:13,155 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 11:26:13,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 11:26:13,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135271738] [2023-12-26 11:26:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135271738] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 11:26:13,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 11:26:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-12-26 11:26:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607061184] [2023-12-26 11:26:13,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 11:26:13,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-26 11:26:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 11:26:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-26 11:26:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=277, Unknown=1, NotChecked=0, Total=380 [2023-12-26 11:26:13,163 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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 11:26:18,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:26:19,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:26:24,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:26:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 11:26:29,667 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-26 11:26:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-26 11:26:29,668 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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 11:26:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 11:26:29,669 INFO L225 Difference]: With dead ends: 29 [2023-12-26 11:26:29,669 INFO L226 Difference]: Without dead ends: 27 [2023-12-26 11:26:29,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=335, Invalid=786, Unknown=1, NotChecked=0, Total=1122 [2023-12-26 11:26:29,670 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 42 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-12-26 11:26:29,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 16 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 52 Invalid, 1 Unknown, 0 Unchecked, 12.8s Time] [2023-12-26 11:26:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-26 11:26:29,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-12-26 11:26:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-26 11:26:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-12-26 11:26:29,678 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2023-12-26 11:26:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 11:26:29,679 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-12-26 11:26:29,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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 11:26:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-12-26 11:26:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-26 11:26:29,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 11:26:29,679 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2023-12-26 11:26:29,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-26 11:26:29,880 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 11:26:29,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 11:26:29,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 11:26:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash 284396189, now seen corresponding path program 3 times [2023-12-26 11:26:29,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 11:26:29,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [64633534] [2023-12-26 11:26:29,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-26 11:26:29,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-26 11:26:29,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 11:26:29,889 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 11:26:29,890 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 11:27:09,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-26 11:27:09,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 11:27:09,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 10781 conjuncts, 121 conjunts are in the unsatisfiable core [2023-12-26 11:27:09,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 11:27:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 11:27:26,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-26 11:28:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-26 11:28:04,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-26 11:28:04,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [64633534] [2023-12-26 11:28:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [64633534] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-26 11:28:04,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-26 11:28:04,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2023-12-26 11:28:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632043204] [2023-12-26 11:28:04,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-26 11:28:04,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-26 11:28:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-26 11:28:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-26 11:28:04,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=906, Unknown=0, NotChecked=0, Total=1260 [2023-12-26 11:28:04,493 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 states have internal predecessors, (49), 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 11:29:14,508 WARN L293 SmtUtils]: Spent 10.87s on a formula simplification. DAG size of input: 5206 DAG size of output: 5187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 11:29:28,680 WARN L293 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 5208 DAG size of output: 5189 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 11:29:32,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:29:36,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:29:40,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:29:43,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:29:47,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-12-26 11:29:57,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:00,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:04,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:10,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:14,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:15,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:21,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:24,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:28,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:32,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:35,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:41,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:44,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:50,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:55,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:30:57,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:31:03,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-12-26 11:31:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-26 11:31:11,013 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2023-12-26 11:31:11,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-26 11:31:11,014 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-26 11:31:11,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-26 11:31:11,014 INFO L225 Difference]: With dead ends: 53 [2023-12-26 11:31:11,014 INFO L226 Difference]: Without dead ends: 51 [2023-12-26 11:31:11,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 141.2s TimeCoverageRelationStatistics Valid=1284, Invalid=3006, Unknown=0, NotChecked=0, Total=4290 [2023-12-26 11:31:11,016 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 108 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 72 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 81.2s IncrementalHoareTripleChecker+Time [2023-12-26 11:31:11,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 18 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 100 Invalid, 9 Unknown, 0 Unchecked, 81.2s Time] [2023-12-26 11:31:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-26 11:31:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-12-26 11:31:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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 11:31:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2023-12-26 11:31:11,137 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 25 [2023-12-26 11:31:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-26 11:31:11,137 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2023-12-26 11:31:11,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 35 states have internal predecessors, (49), 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 11:31:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2023-12-26 11:31:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-26 11:31:11,138 INFO L187 NwaCegarLoop]: Found error trace [2023-12-26 11:31:11,138 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1] [2023-12-26 11:31:11,206 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 11:31:11,354 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 11:31:11,354 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-26 11:31:11,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-26 11:31:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1924535709, now seen corresponding path program 4 times [2023-12-26 11:31:11,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-26 11:31:11,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268035627] [2023-12-26 11:31:11,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-26 11:31:11,366 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 11:31:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-26 11:31:11,367 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 11:31:11,369 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 11:34:11,658 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-26 11:34:11,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-26 11:34:12,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 22933 conjuncts, 217 conjunts are in the unsatisfiable core [2023-12-26 11:34:12,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-26 11:34:47,542 WARN L293 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 4322 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 11:35:02,909 WARN L293 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 4328 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 11:35:48,543 WARN L293 SmtUtils]: Spent 15.81s on a formula simplification that was a NOOP. DAG size: 8669 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 11:36:35,422 WARN L293 SmtUtils]: Spent 14.83s on a formula simplification that was a NOOP. DAG size: 8675 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-26 11:39:09,330 WARN L293 SmtUtils]: Spent 1.04m on a formula simplification that was a NOOP. DAG size: 17368 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-26 11:40:14,631 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 11:40:14,631 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 11:40:15,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-26 11:40:15,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-26 11:40:15,772 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 11:40:15,858 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 11:40:15,858 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 50 with TraceHistMax 16,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-26 11:40:15,862 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2023-12-26 11:40:15,863 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-26 11:40:15,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:40:15 BoogieIcfgContainer [2023-12-26 11:40:15,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-26 11:40:15,865 INFO L158 Benchmark]: Toolchain (without parser) took 869404.82ms. Allocated memory was 349.2MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 297.7MB in the beginning and 1.0GB in the end (delta: -735.5MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-12-26 11:40:15,865 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory was 158.0MB in the beginning and 157.8MB in the end (delta: 137.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-26 11:40:15,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.80ms. Allocated memory is still 349.2MB. Free memory was 297.3MB in the beginning and 301.8MB in the end (delta: -4.5MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. [2023-12-26 11:40:15,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.83ms. Allocated memory is still 349.2MB. Free memory was 301.8MB in the beginning and 287.7MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-26 11:40:15,865 INFO L158 Benchmark]: Boogie Preprocessor took 146.18ms. Allocated memory is still 349.2MB. Free memory was 287.7MB in the beginning and 270.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-26 11:40:15,865 INFO L158 Benchmark]: RCFGBuilder took 1992.71ms. Allocated memory is still 349.2MB. Free memory was 270.4MB in the beginning and 156.9MB in the end (delta: 113.5MB). Peak memory consumption was 176.4MB. Max. memory is 8.0GB. [2023-12-26 11:40:15,866 INFO L158 Benchmark]: TraceAbstraction took 866541.76ms. Allocated memory was 349.2MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 156.4MB in the beginning and 1.0GB in the end (delta: -876.8MB). Peak memory consumption was 870.8MB. Max. memory is 8.0GB. [2023-12-26 11:40:15,867 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.12ms. Allocated memory is still 206.6MB. Free memory was 158.0MB in the beginning and 157.8MB in the end (delta: 137.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 610.80ms. Allocated memory is still 349.2MB. Free memory was 297.3MB in the beginning and 301.8MB in the end (delta: -4.5MB). Peak memory consumption was 66.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 107.83ms. Allocated memory is still 349.2MB. Free memory was 301.8MB in the beginning and 287.7MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 146.18ms. Allocated memory is still 349.2MB. Free memory was 287.7MB in the beginning and 270.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * RCFGBuilder took 1992.71ms. Allocated memory is still 349.2MB. Free memory was 270.4MB in the beginning and 156.9MB in the end (delta: 113.5MB). Peak memory consumption was 176.4MB. Max. memory is 8.0GB. * TraceAbstraction took 866541.76ms. Allocated memory was 349.2MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 156.4MB in the beginning and 1.0GB in the end (delta: -876.8MB). Peak memory consumption was 870.8MB. 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 50 with TraceHistMax 16,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 866.5s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 210.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 100.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 100.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 193 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 8 mSDtfsCounter, 193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 151.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 44.7s SatisfiabilityAnalysisTime, 63.7s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 87 ConstructedInterpolants, 67 QuantifiedInterpolants, 95304 SizeOfPredicates, 252 NumberOfNonLiveVariables, 17301 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown