/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 20:57:39,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 20:57:39,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-12-16 20:57:39,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 20:57:39,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 20:57:39,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 20:57:39,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 20:57:39,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 20:57:39,845 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 20:57:39,845 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 20:57:39,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 20:57:39,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 20:57:39,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 20:57:39,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 20:57:39,847 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 20:57:39,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 20:57:39,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 20:57:39,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 20:57:39,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 20:57:39,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 20:57:39,848 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 20:57:39,848 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 20:57:39,849 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 20:57:39,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 20:57:39,849 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 20:57:39,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 20:57:39,849 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 20:57:39,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 20:57:39,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 20:57:39,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 20:57:39,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 20:57:39,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 20:57:39,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 20:57:39,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 20:57:39,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 20:57:39,851 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 20:57:39,851 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 20:57:39,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 20:57:39,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 20:57:39,852 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 20:57:39,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 20:57:39,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 20:57:39,854 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 20:57:39,854 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 20:57:40,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 20:57:40,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 20:57:40,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 20:57:40,060 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 20:57:40,061 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 20:57:40,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2023-12-16 20:57:41,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 20:57:41,452 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 20:57:41,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2023-12-16 20:57:41,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86070578/e9b2d7c14d5843ec8ca5169433a05cd3/FLAGa26713072 [2023-12-16 20:57:41,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86070578/e9b2d7c14d5843ec8ca5169433a05cd3 [2023-12-16 20:57:41,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 20:57:41,505 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 20:57:41,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 20:57:41,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 20:57:41,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 20:57:41,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:57:41" (1/1) ... [2023-12-16 20:57:41,511 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4282cefb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:41, skipping insertion in model container [2023-12-16 20:57:41,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:57:41" (1/1) ... [2023-12-16 20:57:41,555 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 20:57:41,692 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c[1268,1281] [2023-12-16 20:57:41,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 20:57:41,890 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 20:57:41,898 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c[1268,1281] [2023-12-16 20:57:42,013 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 20:57:42,023 INFO L206 MainTranslator]: Completed translation [2023-12-16 20:57:42,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42 WrapperNode [2023-12-16 20:57:42,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 20:57:42,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 20:57:42,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 20:57:42,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 20:57:42,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,104 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 961 [2023-12-16 20:57:42,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 20:57:42,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 20:57:42,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 20:57:42,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 20:57:42,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,170 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 4, 4]. [2023-12-16 20:57:42,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 20:57:42,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 20:57:42,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 20:57:42,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 20:57:42,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (1/1) ... [2023-12-16 20:57:42,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 20:57:42,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 20:57:42,295 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 20:57:42,303 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 20:57:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 20:57:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 20:57:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 20:57:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 20:57:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 20:57:42,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 20:57:42,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 20:57:42,319 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 20:57:42,319 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 20:57:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 20:57:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 20:57:42,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 20:57:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 20:57:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 20:57:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 20:57:42,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 20:57:42,498 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 20:57:42,499 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 20:57:43,013 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 20:57:43,058 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 20:57:43,058 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-12-16 20:57:43,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:57:43 BoogieIcfgContainer [2023-12-16 20:57:43,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 20:57:43,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 20:57:43,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 20:57:43,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 20:57:43,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:57:41" (1/3) ... [2023-12-16 20:57:43,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adede3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:57:43, skipping insertion in model container [2023-12-16 20:57:43,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:57:42" (2/3) ... [2023-12-16 20:57:43,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7adede3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:57:43, skipping insertion in model container [2023-12-16 20:57:43,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:57:43" (3/3) ... [2023-12-16 20:57:43,066 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_arbitrated_fifos_n2d8w8.c [2023-12-16 20:57:43,077 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 20:57:43,077 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 20:57:43,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 20:57:43,123 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;@64e8dc42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 20:57:43,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 20:57:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 20:57:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 20:57:43,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:43,134 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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 20:57:43,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:43,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash 379434614, now seen corresponding path program 1 times [2023-12-16 20:57:43,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313707793] [2023-12-16 20:57:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:43,148 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 20:57:43,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:43,160 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 20:57:43,169 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 20:57:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:43,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 20:57:43,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 20:57:43,485 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:43,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313707793] [2023-12-16 20:57:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313707793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:43,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:43,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 20:57:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47888288] [2023-12-16 20:57:43,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:43,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 20:57:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 20:57:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 20:57:43,515 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 20:57:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:43,576 INFO L93 Difference]: Finished difference Result 64 states and 106 transitions. [2023-12-16 20:57:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 20:57:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-12-16 20:57:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:43,582 INFO L225 Difference]: With dead ends: 64 [2023-12-16 20:57:43,583 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 20:57:43,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 20:57:43,587 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:43,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:57:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 20:57:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-16 20:57:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 20:57:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-12-16 20:57:43,618 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 38 [2023-12-16 20:57:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:43,618 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-12-16 20:57:43,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 20:57:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-12-16 20:57:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 20:57:43,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:43,621 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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 20:57:43,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 20:57:43,824 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 20:57:43,825 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:43,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1121348902, now seen corresponding path program 1 times [2023-12-16 20:57:43,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:43,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134567208] [2023-12-16 20:57:43,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:43,827 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 20:57:43,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:43,828 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 20:57:43,829 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 20:57:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:44,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:57:44,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:44,093 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 20:57:44,093 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:44,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:44,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134567208] [2023-12-16 20:57:44,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134567208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:44,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:44,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 20:57:44,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790594176] [2023-12-16 20:57:44,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:44,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:57:44,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:44,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:57:44,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:44,098 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 20:57:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:44,140 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2023-12-16 20:57:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:57:44,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2023-12-16 20:57:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:44,142 INFO L225 Difference]: With dead ends: 63 [2023-12-16 20:57:44,142 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 20:57:44,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 20:57:44,144 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:44,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:57:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 20:57:44,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-16 20:57:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 20:57:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2023-12-16 20:57:44,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 38 [2023-12-16 20:57:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:44,160 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2023-12-16 20:57:44,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 20:57:44,161 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2023-12-16 20:57:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 20:57:44,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:44,164 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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 20:57:44,179 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 20:57:44,367 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 20:57:44,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:44,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:44,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1725232375, now seen corresponding path program 1 times [2023-12-16 20:57:44,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786978476] [2023-12-16 20:57:44,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:44,371 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 20:57:44,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:44,387 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 20:57:44,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 20:57:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:44,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:57:44,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 20:57:44,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 20:57:44,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786978476] [2023-12-16 20:57:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786978476] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:44,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:44,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-12-16 20:57:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059401430] [2023-12-16 20:57:44,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:44,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:57:44,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:44,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:57:44,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:57:44,669 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 20:57:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:44,769 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-12-16 20:57:44,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:57:44,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 39 [2023-12-16 20:57:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:44,770 INFO L225 Difference]: With dead ends: 66 [2023-12-16 20:57:44,770 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 20:57:44,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:57:44,771 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:44,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 20:57:44,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-16 20:57:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 20:57:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2023-12-16 20:57:44,775 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 39 [2023-12-16 20:57:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:44,775 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2023-12-16 20:57:44,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 20:57:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2023-12-16 20:57:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-16 20:57:44,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:44,776 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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 20:57:44,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 20:57:44,981 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 20:57:44,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:44,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1843242650, now seen corresponding path program 2 times [2023-12-16 20:57:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913013504] [2023-12-16 20:57:44,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:57:44,983 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 20:57:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:44,984 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 20:57:44,986 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 20:57:45,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 20:57:45,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:45,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:57:45,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-16 20:57:45,217 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:45,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913013504] [2023-12-16 20:57:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913013504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:57:45,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491712533] [2023-12-16 20:57:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:45,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:57:45,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:45,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:57:45,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:45,219 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 20:57:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:45,274 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2023-12-16 20:57:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:57:45,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2023-12-16 20:57:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:45,275 INFO L225 Difference]: With dead ends: 65 [2023-12-16 20:57:45,275 INFO L226 Difference]: Without dead ends: 37 [2023-12-16 20:57:45,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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 20:57:45,279 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:45,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:57:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-16 20:57:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-16 20:57:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 20:57:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2023-12-16 20:57:45,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 42 [2023-12-16 20:57:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:45,290 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2023-12-16 20:57:45,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 20:57:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2023-12-16 20:57:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 20:57:45,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:45,290 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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 20:57:45,294 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 20:57:45,495 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 20:57:45,495 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:45,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1954196330, now seen corresponding path program 1 times [2023-12-16 20:57:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987041580] [2023-12-16 20:57:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:45,497 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 20:57:45,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:45,499 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 20:57:45,499 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 20:57:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:45,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:57:45,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:45,767 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-16 20:57:45,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-12-16 20:57:45,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:45,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987041580] [2023-12-16 20:57:45,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987041580] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:45,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:45,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2023-12-16 20:57:45,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386300949] [2023-12-16 20:57:45,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:45,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:57:45,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:57:45,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:57:45,828 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 20:57:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:45,959 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-12-16 20:57:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:57:45,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 43 [2023-12-16 20:57:45,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:45,960 INFO L225 Difference]: With dead ends: 72 [2023-12-16 20:57:45,960 INFO L226 Difference]: Without dead ends: 41 [2023-12-16 20:57:45,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:57:45,961 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:45,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-16 20:57:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-16 20:57:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 20:57:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2023-12-16 20:57:45,965 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 43 [2023-12-16 20:57:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:45,965 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2023-12-16 20:57:45,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 20:57:45,965 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2023-12-16 20:57:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 20:57:45,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:45,966 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 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 20:57:45,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:46,170 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 20:57:46,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:46,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash 553150250, now seen corresponding path program 2 times [2023-12-16 20:57:46,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:46,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503984786] [2023-12-16 20:57:46,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:57:46,172 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 20:57:46,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:46,173 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 20:57:46,177 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 20:57:46,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 20:57:46,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:46,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 20:57:46,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-16 20:57:46,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:46,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:46,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503984786] [2023-12-16 20:57:46,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503984786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:46,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:46,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 20:57:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021370999] [2023-12-16 20:57:46,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 20:57:46,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:46,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 20:57:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 20:57:46,614 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 20:57:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:46,915 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2023-12-16 20:57:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 20:57:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2023-12-16 20:57:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:46,917 INFO L225 Difference]: With dead ends: 64 [2023-12-16 20:57:46,917 INFO L226 Difference]: Without dead ends: 62 [2023-12-16 20:57:46,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:57:46,917 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:46,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 69 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 20:57:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-16 20:57:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2023-12-16 20:57:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2023-12-16 20:57:46,927 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 47 [2023-12-16 20:57:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:46,928 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2023-12-16 20:57:46,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 20:57:46,928 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2023-12-16 20:57:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-16 20:57:46,929 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:46,930 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:46,951 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 20:57:47,134 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 20:57:47,134 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:47,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash 943381507, now seen corresponding path program 1 times [2023-12-16 20:57:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:47,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846025032] [2023-12-16 20:57:47,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:47,137 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 20:57:47,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:47,138 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 20:57:47,139 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 20:57:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:47,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:57:47,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 20:57:47,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 20:57:47,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:47,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846025032] [2023-12-16 20:57:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846025032] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:47,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 20:57:47,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211740284] [2023-12-16 20:57:47,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:47,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:57:47,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:47,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:57:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:57:47,718 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 20:57:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:47,861 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2023-12-16 20:57:47,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:57:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 88 [2023-12-16 20:57:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:47,864 INFO L225 Difference]: With dead ends: 96 [2023-12-16 20:57:47,864 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 20:57:47,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:57:47,865 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:47,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 20:57:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-16 20:57:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2023-12-16 20:57:47,882 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 88 [2023-12-16 20:57:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:47,882 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2023-12-16 20:57:47,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 20:57:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2023-12-16 20:57:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 20:57:47,887 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:47,887 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:47,903 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 20:57:48,103 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 20:57:48,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:48,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2011203577, now seen corresponding path program 2 times [2023-12-16 20:57:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:48,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351288729] [2023-12-16 20:57:48,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:57:48,109 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 20:57:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:48,112 INFO L229 MonitoredProcess]: Starting monitored process 9 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 20:57:48,117 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 (9)] Waiting until timeout for monitored process [2023-12-16 20:57:48,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 20:57:48,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:48,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:57:48,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 20:57:48,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-16 20:57:48,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:48,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351288729] [2023-12-16 20:57:48,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351288729] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:48,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:57:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576013121] [2023-12-16 20:57:48,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:48,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:57:48,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:48,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:57:48,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:57:48,806 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 20:57:48,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:48,955 INFO L93 Difference]: Finished difference Result 100 states and 132 transitions. [2023-12-16 20:57:48,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:57:48,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 91 [2023-12-16 20:57:48,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:48,956 INFO L225 Difference]: With dead ends: 100 [2023-12-16 20:57:48,956 INFO L226 Difference]: Without dead ends: 60 [2023-12-16 20:57:48,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:57:48,957 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:48,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-16 20:57:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-16 20:57:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2023-12-16 20:57:48,965 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 91 [2023-12-16 20:57:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:48,965 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2023-12-16 20:57:48,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-16 20:57:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2023-12-16 20:57:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 20:57:48,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:48,967 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:48,978 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:49,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 20:57:49,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:49,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash 2005849863, now seen corresponding path program 3 times [2023-12-16 20:57:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043830755] [2023-12-16 20:57:49,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:57:49,176 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 20:57:49,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:49,177 INFO L229 MonitoredProcess]: Starting monitored process 10 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 20:57:49,179 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 (10)] Waiting until timeout for monitored process [2023-12-16 20:57:49,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 20:57:49,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:49,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:57:49,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-12-16 20:57:49,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:49,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:49,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043830755] [2023-12-16 20:57:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043830755] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:49,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:49,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:57:49,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624884892] [2023-12-16 20:57:49,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:49,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:57:49,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:49,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:57:49,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:49,712 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 20:57:49,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:49,794 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2023-12-16 20:57:49,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:57:49,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2023-12-16 20:57:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:49,796 INFO L225 Difference]: With dead ends: 88 [2023-12-16 20:57:49,796 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 20:57:49,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 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 20:57:49,797 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:49,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 20:57:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-16 20:57:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2023-12-16 20:57:49,807 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 95 [2023-12-16 20:57:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:49,807 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2023-12-16 20:57:49,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 20:57:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2023-12-16 20:57:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 20:57:49,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:49,809 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:49,831 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:50,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 20:57:50,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:50,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1116774267, now seen corresponding path program 1 times [2023-12-16 20:57:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:50,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125515454] [2023-12-16 20:57:50,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:50,034 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 20:57:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:50,035 INFO L229 MonitoredProcess]: Starting monitored process 11 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 20:57:50,037 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 (11)] Waiting until timeout for monitored process [2023-12-16 20:57:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:50,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:57:50,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-12-16 20:57:50,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-12-16 20:57:50,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:50,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125515454] [2023-12-16 20:57:50,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125515454] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:50,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:50,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 20:57:50,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845555013] [2023-12-16 20:57:50,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:50,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:57:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:50,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:57:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:57:50,751 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:57:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:50,883 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2023-12-16 20:57:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:57:50,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2023-12-16 20:57:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:50,885 INFO L225 Difference]: With dead ends: 92 [2023-12-16 20:57:50,885 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 20:57:50,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:57:50,885 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:50,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 20:57:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-16 20:57:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2023-12-16 20:57:50,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 96 [2023-12-16 20:57:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:50,894 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2023-12-16 20:57:50,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:57:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2023-12-16 20:57:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 20:57:50,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:50,895 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:50,908 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:51,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 20:57:51,104 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:51,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:51,105 INFO L85 PathProgramCache]: Analyzing trace with hash 807683719, now seen corresponding path program 2 times [2023-12-16 20:57:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655322204] [2023-12-16 20:57:51,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:57:51,106 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 20:57:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:51,107 INFO L229 MonitoredProcess]: Starting monitored process 12 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 20:57:51,108 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 (12)] Waiting until timeout for monitored process [2023-12-16 20:57:51,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 20:57:51,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:51,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:57:51,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 112 proven. 10 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-12-16 20:57:52,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-12-16 20:57:52,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655322204] [2023-12-16 20:57:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655322204] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:52,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:57:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566230473] [2023-12-16 20:57:52,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:52,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:57:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:52,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:57:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:57:52,101 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:57:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:52,355 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2023-12-16 20:57:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:57:52,356 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2023-12-16 20:57:52,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:52,357 INFO L225 Difference]: With dead ends: 99 [2023-12-16 20:57:52,357 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 20:57:52,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:57:52,357 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:52,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 20:57:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 20:57:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-12-16 20:57:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.125) internal successors, (63), 56 states have internal predecessors, (63), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2023-12-16 20:57:52,366 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 99 [2023-12-16 20:57:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:52,366 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2023-12-16 20:57:52,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:57:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2023-12-16 20:57:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 20:57:52,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:52,367 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:52,394 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:52,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 20:57:52,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:52,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1183451641, now seen corresponding path program 3 times [2023-12-16 20:57:52,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:52,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014347638] [2023-12-16 20:57:52,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:57:52,580 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 20:57:52,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:52,581 INFO L229 MonitoredProcess]: Starting monitored process 13 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 20:57:52,583 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 (13)] Waiting until timeout for monitored process [2023-12-16 20:57:53,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 20:57:53,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:53,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:57:53,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2023-12-16 20:57:53,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:53,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:53,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014347638] [2023-12-16 20:57:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014347638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:53,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:53,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:57:53,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38608303] [2023-12-16 20:57:53,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:53,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:57:53,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:53,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:57:53,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:53,052 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 20:57:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:53,103 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2023-12-16 20:57:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:57:53,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2023-12-16 20:57:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:53,105 INFO L225 Difference]: With dead ends: 104 [2023-12-16 20:57:53,105 INFO L226 Difference]: Without dead ends: 69 [2023-12-16 20:57:53,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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 20:57:53,106 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:53,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:57:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-16 20:57:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-12-16 20:57:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2023-12-16 20:57:53,114 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 103 [2023-12-16 20:57:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:53,114 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2023-12-16 20:57:53,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 20:57:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2023-12-16 20:57:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 20:57:53,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:53,115 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:53,137 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:53,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 20:57:53,324 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:53,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash 367079868, now seen corresponding path program 1 times [2023-12-16 20:57:53,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:53,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522477108] [2023-12-16 20:57:53,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:53,325 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 20:57:53,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:53,334 INFO L229 MonitoredProcess]: Starting monitored process 14 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 20:57:53,335 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 (14)] Waiting until timeout for monitored process [2023-12-16 20:57:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:54,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:57:54,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-16 20:57:54,313 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:54,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522477108] [2023-12-16 20:57:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522477108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:54,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:54,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:57:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611656003] [2023-12-16 20:57:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:54,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:57:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:54,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:57:54,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:54,316 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 20:57:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:54,406 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2023-12-16 20:57:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:57:54,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2023-12-16 20:57:54,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:54,408 INFO L225 Difference]: With dead ends: 106 [2023-12-16 20:57:54,408 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 20:57:54,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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 20:57:54,409 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:54,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 20:57:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-16 20:57:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 58 states have internal predecessors, (65), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2023-12-16 20:57:54,418 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 104 [2023-12-16 20:57:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:54,419 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2023-12-16 20:57:54,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 20:57:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2023-12-16 20:57:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 20:57:54,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:54,420 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:54,438 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:54,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 20:57:54,634 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:54,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:54,635 INFO L85 PathProgramCache]: Analyzing trace with hash 899727729, now seen corresponding path program 1 times [2023-12-16 20:57:54,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:54,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129207144] [2023-12-16 20:57:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:54,636 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 20:57:54,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:54,637 INFO L229 MonitoredProcess]: Starting monitored process 15 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 20:57:54,639 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 (15)] Waiting until timeout for monitored process [2023-12-16 20:57:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:55,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:57:55,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-16 20:57:55,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-12-16 20:57:55,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:55,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129207144] [2023-12-16 20:57:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129207144] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:55,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 20:57:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361163773] [2023-12-16 20:57:55,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:55,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:57:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:55,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:57:55,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:57:55,872 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:57:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:55,982 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2023-12-16 20:57:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:57:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2023-12-16 20:57:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:55,983 INFO L225 Difference]: With dead ends: 110 [2023-12-16 20:57:55,983 INFO L226 Difference]: Without dead ends: 73 [2023-12-16 20:57:55,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:57:55,984 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:55,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:57:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-16 20:57:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-16 20:57:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2023-12-16 20:57:55,991 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 105 [2023-12-16 20:57:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:55,991 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2023-12-16 20:57:55,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:57:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2023-12-16 20:57:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 20:57:55,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:55,992 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:56,004 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 (15)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:56,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 20:57:56,204 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:56,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash -786303236, now seen corresponding path program 2 times [2023-12-16 20:57:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:56,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596222320] [2023-12-16 20:57:56,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:57:56,206 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 20:57:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:56,213 INFO L229 MonitoredProcess]: Starting monitored process 16 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 20:57:56,218 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 (16)] Waiting until timeout for monitored process [2023-12-16 20:57:57,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 20:57:57,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:57,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:57:57,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 112 proven. 10 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-16 20:57:57,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2023-12-16 20:57:57,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:57,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596222320] [2023-12-16 20:57:57,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596222320] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:57,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:57,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:57:57,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715035293] [2023-12-16 20:57:57,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:57,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:57:57,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:57,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:57:57,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:57:57,515 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:57:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:57,706 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2023-12-16 20:57:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:57:57,707 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2023-12-16 20:57:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:57,707 INFO L225 Difference]: With dead ends: 117 [2023-12-16 20:57:57,707 INFO L226 Difference]: Without dead ends: 77 [2023-12-16 20:57:57,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:57:57,709 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:57,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 20:57:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-16 20:57:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-16 20:57:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 65 states have internal predecessors, (72), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2023-12-16 20:57:57,716 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 108 [2023-12-16 20:57:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:57,716 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2023-12-16 20:57:57,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:57:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2023-12-16 20:57:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 20:57:57,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:57,717 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:57,727 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 (16)] Ended with exit code 0 [2023-12-16 20:57:57,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 20:57:57,927 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:57,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash -939647940, now seen corresponding path program 3 times [2023-12-16 20:57:57,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:57,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155550333] [2023-12-16 20:57:57,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:57:57,928 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 20:57:57,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:57,929 INFO L229 MonitoredProcess]: Starting monitored process 17 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 20:57:57,931 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 (17)] Waiting until timeout for monitored process [2023-12-16 20:57:58,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 20:57:58,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:57:58,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 20:57:58,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-16 20:57:58,402 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 20:57:58,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:58,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155550333] [2023-12-16 20:57:58,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155550333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 20:57:58,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 20:57:58,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 20:57:58,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431439270] [2023-12-16 20:57:58,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 20:57:58,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 20:57:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:58,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 20:57:58,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 20:57:58,404 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 20:57:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:57:58,446 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2023-12-16 20:57:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 20:57:58,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2023-12-16 20:57:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:57:58,449 INFO L225 Difference]: With dead ends: 122 [2023-12-16 20:57:58,449 INFO L226 Difference]: Without dead ends: 78 [2023-12-16 20:57:58,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 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 20:57:58,449 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 20:57:58,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 20:57:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-16 20:57:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-12-16 20:57:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:57:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2023-12-16 20:57:58,458 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 112 [2023-12-16 20:57:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:57:58,458 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2023-12-16 20:57:58,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 20:57:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2023-12-16 20:57:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 20:57:58,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:57:58,460 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:57:58,479 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 (17)] Forceful destruction successful, exit code 0 [2023-12-16 20:57:58,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 20:57:58,661 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:57:58,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:57:58,661 INFO L85 PathProgramCache]: Analyzing trace with hash -943140613, now seen corresponding path program 1 times [2023-12-16 20:57:58,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:57:58,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174407856] [2023-12-16 20:57:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 20:57:58,663 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 20:57:58,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:57:58,664 INFO L229 MonitoredProcess]: Starting monitored process 18 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 20:57:58,666 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 (18)] Waiting until timeout for monitored process [2023-12-16 20:57:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 20:57:59,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:57:59,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:57:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-16 20:57:59,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:57:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 20:57:59,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:57:59,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174407856] [2023-12-16 20:57:59,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174407856] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:57:59,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:57:59,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 20:57:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773356555] [2023-12-16 20:57:59,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:57:59,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 20:57:59,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:57:59,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 20:57:59,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 20:57:59,992 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:58:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:00,079 INFO L93 Difference]: Finished difference Result 126 states and 152 transitions. [2023-12-16 20:58:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 20:58:00,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2023-12-16 20:58:00,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:00,080 INFO L225 Difference]: With dead ends: 126 [2023-12-16 20:58:00,080 INFO L226 Difference]: Without dead ends: 81 [2023-12-16 20:58:00,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 20:58:00,081 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:00,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-16 20:58:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-16 20:58:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 69 states have internal predecessors, (76), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:58:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2023-12-16 20:58:00,088 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 113 [2023-12-16 20:58:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:00,089 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2023-12-16 20:58:00,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:58:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2023-12-16 20:58:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 20:58:00,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:00,090 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:58:00,100 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 (18)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:00,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 20:58:00,300 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:00,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1399013936, now seen corresponding path program 2 times [2023-12-16 20:58:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:00,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1127025917] [2023-12-16 20:58:00,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 20:58:00,302 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 20:58:00,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:00,304 INFO L229 MonitoredProcess]: Starting monitored process 19 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 20:58:00,305 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 (19)] Waiting until timeout for monitored process [2023-12-16 20:58:02,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 20:58:02,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:02,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:58:02,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 112 proven. 10 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2023-12-16 20:58:02,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:02,334 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-16 20:58:02,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:02,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1127025917] [2023-12-16 20:58:02,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1127025917] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:02,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:02,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:58:02,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818512208] [2023-12-16 20:58:02,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:02,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:58:02,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:02,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:58:02,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:58:02,336 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:58:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:02,523 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2023-12-16 20:58:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:58:02,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2023-12-16 20:58:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:02,529 INFO L225 Difference]: With dead ends: 133 [2023-12-16 20:58:02,529 INFO L226 Difference]: Without dead ends: 85 [2023-12-16 20:58:02,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:58:02,531 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:02,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 20:58:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-16 20:58:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-12-16 20:58:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.095890410958904) internal successors, (80), 73 states have internal predecessors, (80), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 20:58:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2023-12-16 20:58:02,546 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 116 [2023-12-16 20:58:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:02,546 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2023-12-16 20:58:02,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:58:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2023-12-16 20:58:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-16 20:58:02,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:02,547 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:58:02,577 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 (19)] Ended with exit code 0 [2023-12-16 20:58:02,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 20:58:02,759 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:02,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -977207152, now seen corresponding path program 3 times [2023-12-16 20:58:02,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:02,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776117901] [2023-12-16 20:58:02,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:58:02,761 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 20:58:02,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:02,763 INFO L229 MonitoredProcess]: Starting monitored process 20 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 20:58:02,769 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 (20)] Waiting until timeout for monitored process [2023-12-16 20:58:03,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 20:58:03,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:03,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-16 20:58:03,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2023-12-16 20:58:04,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:04,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:04,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776117901] [2023-12-16 20:58:04,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776117901] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 20:58:04,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2016593970] [2023-12-16 20:58:04,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 20:58:04,620 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 20:58:04,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 20:58:04,662 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 20:58:04,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-12-16 20:58:06,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-16 20:58:06,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:06,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 20:58:06,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-12-16 20:58:06,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2023-12-16 20:58:06,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2016593970] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:06,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 20:58:06,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2023-12-16 20:58:06,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162447976] [2023-12-16 20:58:06,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:06,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-16 20:58:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:06,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-16 20:58:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-12-16 20:58:06,189 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-16 20:58:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:07,390 INFO L93 Difference]: Finished difference Result 226 states and 272 transitions. [2023-12-16 20:58:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-16 20:58:07,390 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 120 [2023-12-16 20:58:07,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:07,391 INFO L225 Difference]: With dead ends: 226 [2023-12-16 20:58:07,391 INFO L226 Difference]: Without dead ends: 174 [2023-12-16 20:58:07,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2023-12-16 20:58:07,392 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 136 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:07,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 240 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 20:58:07,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-16 20:58:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 137. [2023-12-16 20:58:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 120 states have (on average 1.0916666666666666) internal successors, (131), 120 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 20:58:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 161 transitions. [2023-12-16 20:58:07,430 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 161 transitions. Word has length 120 [2023-12-16 20:58:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:07,430 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 161 transitions. [2023-12-16 20:58:07,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.785714285714286) internal successors, (81), 15 states have internal predecessors, (81), 5 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-12-16 20:58:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 161 transitions. [2023-12-16 20:58:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-16 20:58:07,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:07,432 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:58:07,444 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 (20)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:07,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:07,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 20:58:07,842 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:07,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1440355258, now seen corresponding path program 4 times [2023-12-16 20:58:07,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:07,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611690343] [2023-12-16 20:58:07,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 20:58:07,844 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 20:58:07,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:07,845 INFO L229 MonitoredProcess]: Starting monitored process 22 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 20:58:07,846 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 (22)] Waiting until timeout for monitored process [2023-12-16 20:58:10,314 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 20:58:10,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 20:58:10,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 2240 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 20:58:10,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 20:58:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 496 proven. 10 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2023-12-16 20:58:10,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 20:58:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 296 proven. 10 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2023-12-16 20:58:10,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 20:58:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611690343] [2023-12-16 20:58:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611690343] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 20:58:10,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 20:58:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-16 20:58:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812621635] [2023-12-16 20:58:10,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 20:58:10,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 20:58:10,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 20:58:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 20:58:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-12-16 20:58:10,498 INFO L87 Difference]: Start difference. First operand 137 states and 161 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:58:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 20:58:10,715 INFO L93 Difference]: Finished difference Result 213 states and 258 transitions. [2023-12-16 20:58:10,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 20:58:10,715 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 192 [2023-12-16 20:58:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 20:58:10,717 INFO L225 Difference]: With dead ends: 213 [2023-12-16 20:58:10,717 INFO L226 Difference]: Without dead ends: 145 [2023-12-16 20:58:10,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-12-16 20:58:10,719 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 20:58:10,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 20:58:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-12-16 20:58:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-12-16 20:58:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.0859375) internal successors, (139), 128 states have internal predecessors, (139), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 20:58:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2023-12-16 20:58:10,742 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 192 [2023-12-16 20:58:10,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 20:58:10,742 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2023-12-16 20:58:10,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-16 20:58:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2023-12-16 20:58:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-16 20:58:10,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 20:58:10,743 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 20:58:10,759 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 (22)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:10,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 20:58:10,954 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 20:58:10,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 20:58:10,954 INFO L85 PathProgramCache]: Analyzing trace with hash 442588358, now seen corresponding path program 5 times [2023-12-16 20:58:10,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 20:58:10,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497487335] [2023-12-16 20:58:10,956 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 20:58:10,956 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 20:58:10,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 20:58:10,957 INFO L229 MonitoredProcess]: Starting monitored process 23 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 20:58:10,959 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 (23)] Waiting until timeout for monitored process Received shutdown request... [2023-12-16 20:58:58,262 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 20:58:58,270 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 20:58:59,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-16 20:58:59,463 WARN L435 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 (23)] Forcibly destroying the process [2023-12-16 20:58:59,488 ERROR L246 FreeRefinementEngine]: Caught known exception: Timeout or Toolchain cancelled by user [2023-12-16 20:58:59,489 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 20:58:59,491 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 (23)] Forceful destruction successful, exit code 137 [2023-12-16 20:58:59,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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 20:58:59,491 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 201 with TraceHistMax 16,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [497487335] and IpTcStrategyModuleCvc4 [941568352]. [2023-12-16 20:58:59,495 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 3, 3, 2, 2, 1, 1, 1] [2023-12-16 20:58:59,498 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 20:58:59,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:58:59 BoogieIcfgContainer [2023-12-16 20:58:59,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 20:58:59,502 INFO L158 Benchmark]: Toolchain (without parser) took 77997.08ms. Allocated memory was 283.1MB in the beginning and 399.5MB in the end (delta: 116.4MB). Free memory was 227.6MB in the beginning and 298.3MB in the end (delta: -70.6MB). Peak memory consumption was 46.6MB. Max. memory is 8.0GB. [2023-12-16 20:58:59,502 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 20:58:59,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.64ms. Allocated memory is still 283.1MB. Free memory was 227.2MB in the beginning and 240.2MB in the end (delta: -13.0MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. [2023-12-16 20:58:59,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.71ms. Allocated memory is still 283.1MB. Free memory was 240.2MB in the beginning and 232.9MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 20:58:59,506 INFO L158 Benchmark]: Boogie Preprocessor took 150.94ms. Allocated memory is still 283.1MB. Free memory was 232.9MB in the beginning and 223.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 20:58:59,506 INFO L158 Benchmark]: RCFGBuilder took 802.80ms. Allocated memory is still 283.1MB. Free memory was 223.4MB in the beginning and 206.8MB in the end (delta: 16.5MB). Peak memory consumption was 63.3MB. Max. memory is 8.0GB. [2023-12-16 20:58:59,506 INFO L158 Benchmark]: TraceAbstraction took 76441.28ms. Allocated memory was 283.1MB in the beginning and 399.5MB in the end (delta: 116.4MB). Free memory was 206.3MB in the beginning and 298.3MB in the end (delta: -91.9MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. [2023-12-16 20:58:59,510 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.09ms. Allocated memory is still 197.1MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 516.64ms. Allocated memory is still 283.1MB. Free memory was 227.2MB in the beginning and 240.2MB in the end (delta: -13.0MB). Peak memory consumption was 37.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.71ms. Allocated memory is still 283.1MB. Free memory was 240.2MB in the beginning and 232.9MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 150.94ms. Allocated memory is still 283.1MB. Free memory was 232.9MB in the beginning and 223.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 802.80ms. Allocated memory is still 283.1MB. Free memory was 223.4MB in the beginning and 206.8MB in the end (delta: 16.5MB). Peak memory consumption was 63.3MB. Max. memory is 8.0GB. * TraceAbstraction took 76441.28ms. Allocated memory was 283.1MB in the beginning and 399.5MB in the end (delta: 116.4MB). Free memory was 206.3MB in the beginning and 298.3MB in the end (delta: -91.9MB). Peak memory consumption was 24.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21). Cancelled while NwaCegarLoop was analyzing trace of length 201 with TraceHistMax 16,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [497487335] and IpTcStrategyModuleCvc4 [941568352]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.4s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 2894 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2234 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1446 IncrementalHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 660 mSDtfsCounter, 1446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3132 GetRequests, 2988 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=20, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 46 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.1s SsaConstructionTime, 11.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1909 NumberOfCodeBlocks, 1549 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3086 ConstructedInterpolants, 0 QuantifiedInterpolants, 4282 SizeOfPredicates, 52 NumberOfNonLiveVariables, 20033 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 33 InterpolantComputations, 8 PerfectInterpolantSequences, 9235/9394 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown