/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-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 14:38:58,219 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 14:38:58,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 14:38:58,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 14:38:58,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 14:38:58,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 14:38:58,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 14:38:58,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 14:38:58,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 14:38:58,326 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 14:38:58,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 14:38:58,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 14:38:58,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 14:38:58,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 14:38:58,328 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 14:38:58,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 14:38:58,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 14:38:58,329 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 14:38:58,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 14:38:58,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 14:38:58,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 14:38:58,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 14:38:58,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 14:38:58,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 14:38:58,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 14:38:58,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 14:38:58,338 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 14:38:58,338 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 14:38:58,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 14:38:58,339 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 14:38:58,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 14:38:58,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 14:38:58,340 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 14:38:58,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 14:38:58,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:38:58,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 14:38:58,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 14:38:58,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 14:38:58,341 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 14:38:58,341 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 14:38:58,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 14:38:58,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 14:38:58,342 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 14:38:58,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 14:38:58,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 14:38:58,342 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 14:38:58,343 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-16 14:38:58,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 14:38:58,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 14:38:58,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 14:38:58,590 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 14:38:58,590 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 14:38:58,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-9.i [2023-12-16 14:38:59,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 14:38:59,959 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 14:38:59,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-9.i [2023-12-16 14:38:59,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b257ffb/1c99b7c45c734b15af1aa84a16f59ade/FLAGdf53ad889 [2023-12-16 14:38:59,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b257ffb/1c99b7c45c734b15af1aa84a16f59ade [2023-12-16 14:38:59,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 14:38:59,991 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 14:38:59,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 14:38:59,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 14:38:59,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 14:38:59,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:38:59" (1/1) ... [2023-12-16 14:38:59,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c5489c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:38:59, skipping insertion in model container [2023-12-16 14:38:59,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:38:59" (1/1) ... [2023-12-16 14:39:00,026 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 14:39:00,163 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-9.i[914,927] [2023-12-16 14:39:00,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:39:00,196 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 14:39:00,205 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-9.i[914,927] [2023-12-16 14:39:00,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:39:00,229 INFO L206 MainTranslator]: Completed translation [2023-12-16 14:39:00,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00 WrapperNode [2023-12-16 14:39:00,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 14:39:00,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 14:39:00,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 14:39:00,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 14:39:00,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,262 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 77 [2023-12-16 14:39:00,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 14:39:00,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 14:39:00,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 14:39:00,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 14:39:00,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,285 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-16 14:39:00,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,292 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 14:39:00,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 14:39:00,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 14:39:00,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 14:39:00,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (1/1) ... [2023-12-16 14:39:00,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:39:00,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 14:39:00,337 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-16 14:39:00,363 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-16 14:39:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 14:39:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 14:39:00,371 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 14:39:00,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 14:39:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 14:39:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 14:39:00,445 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 14:39:00,449 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 14:39:00,637 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 14:39:00,687 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 14:39:00,688 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 14:39:00,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:39:00 BoogieIcfgContainer [2023-12-16 14:39:00,688 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 14:39:00,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 14:39:00,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 14:39:00,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 14:39:00,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:38:59" (1/3) ... [2023-12-16 14:39:00,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b4a5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:39:00, skipping insertion in model container [2023-12-16 14:39:00,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:39:00" (2/3) ... [2023-12-16 14:39:00,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b4a5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:39:00, skipping insertion in model container [2023-12-16 14:39:00,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:39:00" (3/3) ... [2023-12-16 14:39:00,695 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-9.i [2023-12-16 14:39:00,708 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 14:39:00,708 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 14:39:00,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 14:39:00,750 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;@29a331d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 14:39:00,751 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 14:39:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 14:39:00,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 14:39:00,762 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:00,762 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:00,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:00,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:00,768 INFO L85 PathProgramCache]: Analyzing trace with hash 704363017, now seen corresponding path program 1 times [2023-12-16 14:39:00,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974641357] [2023-12-16 14:39:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:00,783 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-16 14:39:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:00,788 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-16 14:39:00,828 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-16 14:39:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:00,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 14:39:00,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-16 14:39:04,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:04,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:04,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974641357] [2023-12-16 14:39:04,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974641357] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:04,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:04,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 14:39:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610902725] [2023-12-16 14:39:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:04,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 14:39:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:04,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 14:39:04,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 14:39:04,181 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:05,547 INFO L93 Difference]: Finished difference Result 96 states and 153 transitions. [2023-12-16 14:39:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 14:39:05,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 53 [2023-12-16 14:39:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:05,556 INFO L225 Difference]: With dead ends: 96 [2023-12-16 14:39:05,556 INFO L226 Difference]: Without dead ends: 66 [2023-12-16 14:39:05,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2023-12-16 14:39:05,562 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 104 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:05,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 103 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 14:39:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-16 14:39:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2023-12-16 14:39:05,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:39:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2023-12-16 14:39:05,601 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 53 [2023-12-16 14:39:05,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:05,602 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2023-12-16 14:39:05,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2023-12-16 14:39:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-16 14:39:05,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:05,605 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:05,613 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-16 14:39:05,810 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-16 14:39:05,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:05,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash 706210059, now seen corresponding path program 1 times [2023-12-16 14:39:05,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:05,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688104360] [2023-12-16 14:39:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:05,813 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-16 14:39:05,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:05,814 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-16 14:39:05,817 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-16 14:39:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:05,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 14:39:05,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-16 14:39:07,408 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:07,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688104360] [2023-12-16 14:39:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688104360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:07,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:07,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 14:39:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919365739] [2023-12-16 14:39:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:07,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 14:39:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 14:39:07,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 14:39:07,411 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:08,098 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2023-12-16 14:39:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 14:39:08,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 53 [2023-12-16 14:39:08,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:08,107 INFO L225 Difference]: With dead ends: 109 [2023-12-16 14:39:08,107 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 14:39:08,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-12-16 14:39:08,109 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:08,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 103 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 14:39:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 14:39:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2023-12-16 14:39:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:39:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-12-16 14:39:08,118 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 53 [2023-12-16 14:39:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:08,118 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-12-16 14:39:08,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2023-12-16 14:39:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 14:39:08,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:08,120 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:08,127 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 (3)] Ended with exit code 0 [2023-12-16 14:39:08,325 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-16 14:39:08,325 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:08,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash 346665136, now seen corresponding path program 1 times [2023-12-16 14:39:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:08,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003656593] [2023-12-16 14:39:08,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:08,327 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-16 14:39:08,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:08,328 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-16 14:39:08,341 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-16 14:39:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:08,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 14:39:08,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 14:39:10,993 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:10,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:10,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003656593] [2023-12-16 14:39:10,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003656593] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:10,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:10,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 14:39:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442548919] [2023-12-16 14:39:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:10,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 14:39:10,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:10,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 14:39:10,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-16 14:39:10,995 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 14:39:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:13,793 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2023-12-16 14:39:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-16 14:39:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2023-12-16 14:39:13,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:13,795 INFO L225 Difference]: With dead ends: 87 [2023-12-16 14:39:13,795 INFO L226 Difference]: Without dead ends: 85 [2023-12-16 14:39:13,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=225, Invalid=531, Unknown=0, NotChecked=0, Total=756 [2023-12-16 14:39:13,797 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 122 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:13,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 116 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 14:39:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-16 14:39:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 54. [2023-12-16 14:39:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:39:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2023-12-16 14:39:13,808 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 54 [2023-12-16 14:39:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:13,808 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2023-12-16 14:39:13,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 14:39:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2023-12-16 14:39:13,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 14:39:13,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:13,810 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:13,819 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-16 14:39:14,014 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-16 14:39:14,015 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:14,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:14,016 INFO L85 PathProgramCache]: Analyzing trace with hash 403923438, now seen corresponding path program 1 times [2023-12-16 14:39:14,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:14,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978550743] [2023-12-16 14:39:14,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:14,016 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-16 14:39:14,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:14,017 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-16 14:39:14,023 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-16 14:39:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:14,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 14:39:14,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-16 14:39:16,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:16,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978550743] [2023-12-16 14:39:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978550743] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-16 14:39:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435186781] [2023-12-16 14:39:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:16,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 14:39:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:16,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 14:39:16,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-16 14:39:16,292 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 14:39:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:17,676 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2023-12-16 14:39:17,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 14:39:17,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2023-12-16 14:39:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:17,678 INFO L225 Difference]: With dead ends: 74 [2023-12-16 14:39:17,678 INFO L226 Difference]: Without dead ends: 72 [2023-12-16 14:39:17,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-12-16 14:39:17,680 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 73 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:17,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 119 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 14:39:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-16 14:39:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2023-12-16 14:39:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:39:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2023-12-16 14:39:17,689 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 54 [2023-12-16 14:39:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:17,690 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2023-12-16 14:39:17,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 14:39:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2023-12-16 14:39:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 14:39:17,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:17,691 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:17,700 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-16 14:39:17,896 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-16 14:39:17,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:17,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2137973231, now seen corresponding path program 1 times [2023-12-16 14:39:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:17,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341108184] [2023-12-16 14:39:17,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:17,897 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-16 14:39:17,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:17,899 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-16 14:39:17,901 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-16 14:39:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:17,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 14:39:17,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 14:39:18,673 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:18,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:18,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341108184] [2023-12-16 14:39:18,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341108184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:18,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:18,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 14:39:18,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280012010] [2023-12-16 14:39:18,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:18,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 14:39:18,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:18,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 14:39:18,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 14:39:18,676 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:18,977 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2023-12-16 14:39:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 14:39:18,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2023-12-16 14:39:18,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:18,978 INFO L225 Difference]: With dead ends: 83 [2023-12-16 14:39:18,979 INFO L226 Difference]: Without dead ends: 81 [2023-12-16 14:39:18,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-16 14:39:18,980 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:18,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 138 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 14:39:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-16 14:39:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2023-12-16 14:39:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:39:18,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2023-12-16 14:39:18,988 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 55 [2023-12-16 14:39:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:18,989 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2023-12-16 14:39:18,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:18,989 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2023-12-16 14:39:18,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 14:39:18,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:18,990 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:18,996 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 (6)] Ended with exit code 0 [2023-12-16 14:39:19,194 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-16 14:39:19,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:19,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:19,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2138032813, now seen corresponding path program 1 times [2023-12-16 14:39:19,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:19,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798322458] [2023-12-16 14:39:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:19,196 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-16 14:39:19,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:19,196 INFO L229 MonitoredProcess]: Starting monitored process 7 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-16 14:39:19,198 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 (7)] Waiting until timeout for monitored process [2023-12-16 14:39:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:19,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 14:39:19,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-16 14:39:19,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:19,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:19,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798322458] [2023-12-16 14:39:19,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798322458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:19,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:19,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 14:39:19,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926946606] [2023-12-16 14:39:19,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:19,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 14:39:19,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:19,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 14:39:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 14:39:19,281 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:19,305 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2023-12-16 14:39:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 14:39:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2023-12-16 14:39:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:19,306 INFO L225 Difference]: With dead ends: 105 [2023-12-16 14:39:19,307 INFO L226 Difference]: Without dead ends: 52 [2023-12-16 14:39:19,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 14:39:19,308 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:19,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 67 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 14:39:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-16 14:39:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-12-16 14:39:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:39:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2023-12-16 14:39:19,315 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 55 [2023-12-16 14:39:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:19,316 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2023-12-16 14:39:19,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2023-12-16 14:39:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 14:39:19,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:39:19,317 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:19,323 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 (7)] Forceful destruction successful, exit code 0 [2023-12-16 14:39:19,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-16 14:39:19,517 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:39:19,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:39:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash -363025451, now seen corresponding path program 1 times [2023-12-16 14:39:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:39:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6545689] [2023-12-16 14:39:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:39:19,518 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-16 14:39:19,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:39:19,519 INFO L229 MonitoredProcess]: Starting monitored process 8 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-16 14:39:19,520 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 (8)] Waiting until timeout for monitored process [2023-12-16 14:39:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:39:19,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 14:39:19,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:39:20,569 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-16 14:39:20,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:39:20,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:39:20,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6545689] [2023-12-16 14:39:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6545689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:39:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:39:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 14:39:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802750543] [2023-12-16 14:39:20,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:39:20,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 14:39:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:39:20,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 14:39:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-12-16 14:39:20,572 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:39:21,894 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2023-12-16 14:39:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 14:39:21,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2023-12-16 14:39:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:39:21,896 INFO L225 Difference]: With dead ends: 110 [2023-12-16 14:39:21,896 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 14:39:21,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2023-12-16 14:39:21,897 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 88 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 14:39:21,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 93 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 14:39:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 14:39:21,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 14:39:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 14:39:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 14:39:21,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2023-12-16 14:39:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:39:21,899 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 14:39:21,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-16 14:39:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 14:39:21,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 14:39:21,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 14:39:21,909 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 14:39:22,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-16 14:39:22,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 14:39:24,856 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.geq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse1)) (fp.leq ~var_1_7~0 ((_ to_fp 11 53) currentRoundingMode .cse0))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:39:24,857 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 50 65) no Hoare annotation was computed. [2023-12-16 14:39:24,857 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.geq ~var_1_7~0 .cse3) (fp.leq ~var_1_7~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-16 14:39:24,857 INFO L899 garLoopResultBuilder]: For program point L60-1(line 60) no Hoare annotation was computed. [2023-12-16 14:39:24,857 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-16 14:39:24,857 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.geq ~var_1_7~0 .cse3) (fp.leq ~var_1_7~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-16 14:39:24,857 INFO L895 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.geq ~var_1_7~0 .cse3) (fp.leq ~var_1_7~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-16 14:39:24,857 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 49) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 45) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 35) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 32 49) no Hoare annotation was computed. [2023-12-16 14:39:24,858 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0)) (.cse1 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq ~var_1_8~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.leq ~var_1_8~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.leq ~var_1_8~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.geq ~var_1_8~0 ((_ to_fp 11 53) currentRoundingMode .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:39:24,859 INFO L899 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2023-12-16 14:39:24,859 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.geq ~var_1_7~0 .cse3) (fp.leq ~var_1_7~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-16 14:39:24,859 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-12-16 14:39:24,859 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 14:39:24,859 INFO L895 garLoopResultBuilder]: At program point L75-2(lines 75 81) the Hoare annotation is: (let ((.cse7 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse8 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse8))) (.cse4 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse7))) (.cse6 ((_ to_fp 11 53) currentRoundingMode .cse8)) (.cse5 ((_ to_fp 11 53) currentRoundingMode .cse7))) (let ((.cse0 (or (and (fp.geq ~var_1_8~0 .cse3) (fp.leq ~var_1_8~0 .cse4)) (and (fp.leq ~var_1_8~0 .cse6) (fp.geq ~var_1_8~0 .cse5)))) (.cse1 (or (and (fp.geq ~var_1_7~0 .cse3) (fp.leq ~var_1_7~0 .cse4)) (and (fp.geq ~var_1_7~0 .cse5) (fp.leq ~var_1_7~0 .cse6)))) (.cse2 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 (not (= ~var_1_2~0 (_ bv0 8)))) (and (= ~var_1_3~0 ~var_1_1~0) .cse0 .cse1 .cse2))))) [2023-12-16 14:39:24,859 INFO L899 garLoopResultBuilder]: For program point L75-3(lines 75 81) no Hoare annotation was computed. [2023-12-16 14:39:24,860 INFO L895 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.geq ~var_1_7~0 .cse3) (fp.leq ~var_1_7~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-16 14:39:24,860 INFO L895 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: (let ((.cse5 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse4 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse4))) (.cse1 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse5))) (.cse3 ((_ to_fp 11 53) currentRoundingMode .cse5)) (.cse2 ((_ to_fp 11 53) currentRoundingMode .cse4))) (and (or (and (fp.geq ~var_1_8~0 .cse0) (fp.leq ~var_1_8~0 .cse1)) (and (fp.leq ~var_1_8~0 .cse2) (fp.geq ~var_1_8~0 .cse3))) (or (and (fp.geq ~var_1_7~0 .cse0) (fp.leq ~var_1_7~0 .cse1)) (and (fp.geq ~var_1_7~0 .cse3) (fp.leq ~var_1_7~0 .cse2))) (= currentRoundingMode roundNearestTiesToEven)))) [2023-12-16 14:39:24,860 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 14:39:24,860 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 14:39:24,860 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 14:39:24,860 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 14:39:24,864 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:39:24,865 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 14:39:24,875 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:39:24,876 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:39:24,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:39:24 BoogieIcfgContainer [2023-12-16 14:39:24,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 14:39:24,878 INFO L158 Benchmark]: Toolchain (without parser) took 24887.68ms. Allocated memory was 270.5MB in the beginning and 468.7MB in the end (delta: 198.2MB). Free memory was 218.0MB in the beginning and 191.7MB in the end (delta: 26.4MB). Peak memory consumption was 225.0MB. Max. memory is 8.0GB. [2023-12-16 14:39:24,879 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 183.5MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 14:39:24,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.12ms. Allocated memory is still 270.5MB. Free memory was 217.6MB in the beginning and 205.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 14:39:24,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.74ms. Allocated memory is still 270.5MB. Free memory was 205.4MB in the beginning and 203.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:39:24,880 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 270.5MB. Free memory was 203.4MB in the beginning and 201.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:39:24,881 INFO L158 Benchmark]: RCFGBuilder took 385.66ms. Allocated memory is still 270.5MB. Free memory was 201.3MB in the beginning and 186.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 14:39:24,881 INFO L158 Benchmark]: TraceAbstraction took 24188.04ms. Allocated memory was 270.5MB in the beginning and 468.7MB in the end (delta: 198.2MB). Free memory was 186.0MB in the beginning and 191.7MB in the end (delta: -5.7MB). Peak memory consumption was 193.5MB. Max. memory is 8.0GB. [2023-12-16 14:39:24,883 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.16ms. Allocated memory is still 183.5MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.12ms. Allocated memory is still 270.5MB. Free memory was 217.6MB in the beginning and 205.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.74ms. Allocated memory is still 270.5MB. Free memory was 205.4MB in the beginning and 203.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 270.5MB. Free memory was 203.4MB in the beginning and 201.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 385.66ms. Allocated memory is still 270.5MB. Free memory was 201.3MB in the beginning and 186.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 24188.04ms. Allocated memory was 270.5MB in the beginning and 468.7MB in the end (delta: 198.2MB). Free memory was 186.0MB in the beginning and 191.7MB in the end (delta: -5.7MB). Peak memory consumption was 193.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.1s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 739 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 532 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1059 IncrementalHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 207 mSDtfsCounter, 1059 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=3, InterpolantAutomatonStates: 100, 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, 7 MinimizatonAttempts, 106 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 59 PreInvPairs, 87 NumberOfFragments, 643 HoareAnnotationTreeSize, 59 FormulaSimplifications, 174768 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FormulaSimplificationsInter, 147062 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 2727 SizeOfPredicates, 79 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 784/784 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (!((var_1_2 == 0)) || (var_1_3 == var_1_1)) RESULT: Ultimate proved your program to be correct! [2023-12-16 14:39:24,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...