/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/verifythis/tree_max.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 06:31:22,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 06:31:22,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 06:31:22,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 06:31:22,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 06:31:22,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 06:31:22,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 06:31:22,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 06:31:22,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 06:31:22,183 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 06:31:22,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 06:31:22,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 06:31:22,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 06:31:22,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 06:31:22,185 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 06:31:22,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 06:31:22,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 06:31:22,186 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 06:31:22,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 06:31:22,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 06:31:22,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 06:31:22,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 06:31:22,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 06:31:22,187 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 06:31:22,187 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 06:31:22,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 06:31:22,188 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 06:31:22,188 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 06:31:22,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 06:31:22,188 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 06:31:22,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 06:31:22,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 06:31:22,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 06:31:22,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 06:31:22,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:31:22,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 06:31:22,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 06:31:22,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 06:31:22,190 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 06:31:22,190 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 06:31:22,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 06:31:22,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 06:31:22,191 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 06:31:22,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 06:31:22,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 06:31:22,191 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 06:31:22,192 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-25 06:31:22,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 06:31:22,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 06:31:22,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 06:31:22,455 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 06:31:22,455 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 06:31:22,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_max.c [2023-12-25 06:31:23,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 06:31:24,093 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 06:31:24,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_max.c [2023-12-25 06:31:24,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20db169c1/59b10c35e5544bb3add19f65f3ef18ce/FLAG24f861572 [2023-12-25 06:31:24,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20db169c1/59b10c35e5544bb3add19f65f3ef18ce [2023-12-25 06:31:24,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 06:31:24,119 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 06:31:24,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 06:31:24,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 06:31:24,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 06:31:24,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@becb874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24, skipping insertion in model container [2023-12-25 06:31:24,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,141 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:31:24,258 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_max.c[544,557] [2023-12-25 06:31:24,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:24,287 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-25 06:31:24,292 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 06:31:24,301 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_max.c[544,557] [2023-12-25 06:31:24,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:24,319 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 06:31:24,331 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_max.c[544,557] [2023-12-25 06:31:24,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 06:31:24,357 INFO L206 MainTranslator]: Completed translation [2023-12-25 06:31:24,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24 WrapperNode [2023-12-25 06:31:24,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 06:31:24,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 06:31:24,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 06:31:24,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 06:31:24,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,393 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 37 [2023-12-25 06:31:24,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 06:31:24,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 06:31:24,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 06:31:24,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 06:31:24,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,423 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2023-12-25 06:31:24,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 06:31:24,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 06:31:24,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 06:31:24,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 06:31:24,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (1/1) ... [2023-12-25 06:31:24,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 06:31:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 06:31:24,481 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-25 06:31:24,498 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-25 06:31:24,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 06:31:24,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 06:31:24,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-25 06:31:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-25 06:31:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-25 06:31:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-25 06:31:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-25 06:31:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-25 06:31:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-25 06:31:24,514 INFO L130 BoogieDeclarations]: Found specification of procedure max [2023-12-25 06:31:24,515 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2023-12-25 06:31:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2023-12-25 06:31:24,515 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2023-12-25 06:31:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-12-25 06:31:24,515 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-12-25 06:31:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-25 06:31:24,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 06:31:24,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 06:31:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-25 06:31:24,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-25 06:31:24,600 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 06:31:24,602 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 06:31:24,744 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 06:31:24,758 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 06:31:24,758 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-25 06:31:24,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:31:24 BoogieIcfgContainer [2023-12-25 06:31:24,759 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 06:31:24,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 06:31:24,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 06:31:24,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 06:31:24,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 06:31:24" (1/3) ... [2023-12-25 06:31:24,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1394e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:31:24, skipping insertion in model container [2023-12-25 06:31:24,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 06:31:24" (2/3) ... [2023-12-25 06:31:24,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1394e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 06:31:24, skipping insertion in model container [2023-12-25 06:31:24,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 06:31:24" (3/3) ... [2023-12-25 06:31:24,764 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_max.c [2023-12-25 06:31:24,775 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 06:31:24,775 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 06:31:24,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 06:31:24,805 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;@218adc78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 06:31:24,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 06:31:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 06:31:24,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-25 06:31:24,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:24,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:24,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:24,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash 46899722, now seen corresponding path program 1 times [2023-12-25 06:31:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770542856] [2023-12-25 06:31:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:24,824 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-25 06:31:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:24,840 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-25 06:31:24,854 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-25 06:31:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:24,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 06:31:24,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 06:31:25,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:25,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:25,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770542856] [2023-12-25 06:31:25,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770542856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:25,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:25,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 06:31:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800494500] [2023-12-25 06:31:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:25,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 06:31:25,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 06:31:25,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 06:31:25,205 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:31:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:25,308 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2023-12-25 06:31:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:31:25,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-25 06:31:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:25,315 INFO L225 Difference]: With dead ends: 67 [2023-12-25 06:31:25,316 INFO L226 Difference]: Without dead ends: 35 [2023-12-25 06:31:25,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 06:31:25,320 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 8 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:25,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 259 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 06:31:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-25 06:31:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-12-25 06:31:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-25 06:31:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-12-25 06:31:25,348 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 18 [2023-12-25 06:31:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:25,348 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-12-25 06:31:25,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-25 06:31:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-12-25 06:31:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 06:31:25,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:25,354 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:25,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 06:31:25,556 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-25 06:31:25,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:25,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash 678604871, now seen corresponding path program 1 times [2023-12-25 06:31:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476181762] [2023-12-25 06:31:25,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:25,559 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-25 06:31:25,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:25,560 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-25 06:31:25,585 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-25 06:31:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:25,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 06:31:25,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-25 06:31:25,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 06:31:25,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:25,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476181762] [2023-12-25 06:31:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476181762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 06:31:25,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 06:31:25,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-25 06:31:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132114691] [2023-12-25 06:31:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 06:31:25,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 06:31:25,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:25,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 06:31:25,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-25 06:31:25,685 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 06:31:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:25,796 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-12-25 06:31:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 06:31:25,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2023-12-25 06:31:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:25,798 INFO L225 Difference]: With dead ends: 48 [2023-12-25 06:31:25,798 INFO L226 Difference]: Without dead ends: 37 [2023-12-25 06:31:25,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-25 06:31:25,799 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:25,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 212 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-25 06:31:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-25 06:31:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-25 06:31:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-12-25 06:31:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-12-25 06:31:25,805 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 30 [2023-12-25 06:31:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:25,805 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-12-25 06:31:25,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-25 06:31:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2023-12-25 06:31:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-25 06:31:25,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:25,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:25,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 06:31:26,009 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-25 06:31:26,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:26,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1585903113, now seen corresponding path program 1 times [2023-12-25 06:31:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:26,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673564536] [2023-12-25 06:31:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:26,011 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-25 06:31:26,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:26,012 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-25 06:31:26,039 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-25 06:31:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:26,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-25 06:31:26,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:26,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 06:31:26,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 38 [2023-12-25 06:31:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 06:31:26,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:31:26,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 06:31:26,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 1 [2023-12-25 06:31:27,571 INFO L349 Elim1Store]: treesize reduction 37, result has 81.6 percent of original size [2023-12-25 06:31:27,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 64 treesize of output 183 [2023-12-25 06:31:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 06:31:30,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:30,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673564536] [2023-12-25 06:31:30,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673564536] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:31:30,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:31:30,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2023-12-25 06:31:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031534717] [2023-12-25 06:31:30,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:31:30,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 06:31:30,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:30,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 06:31:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2023-12-25 06:31:30,408 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 06:31:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:32,025 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2023-12-25 06:31:32,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 06:31:32,026 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 43 [2023-12-25 06:31:32,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:32,028 INFO L225 Difference]: With dead ends: 64 [2023-12-25 06:31:32,029 INFO L226 Difference]: Without dead ends: 62 [2023-12-25 06:31:32,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2023-12-25 06:31:32,030 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 91 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:32,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 292 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 06:31:32,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-25 06:31:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2023-12-25 06:31:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2023-12-25 06:31:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2023-12-25 06:31:32,039 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 43 [2023-12-25 06:31:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:32,039 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2023-12-25 06:31:32,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 17 states have internal predecessors, (35), 7 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2023-12-25 06:31:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2023-12-25 06:31:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 06:31:32,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:32,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:32,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-25 06:31:32,241 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-25 06:31:32,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:32,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:32,243 INFO L85 PathProgramCache]: Analyzing trace with hash -256968945, now seen corresponding path program 1 times [2023-12-25 06:31:32,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:32,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651319199] [2023-12-25 06:31:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:32,244 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-25 06:31:32,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:32,252 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-25 06:31:32,253 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-25 06:31:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:32,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-25 06:31:32,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-25 06:31:32,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:31:34,424 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-25 06:31:34,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-12-25 06:31:34,436 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-12-25 06:31:34,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2023-12-25 06:31:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 06:31:34,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:34,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651319199] [2023-12-25 06:31:34,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651319199] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:31:34,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:31:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2023-12-25 06:31:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066215309] [2023-12-25 06:31:34,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:31:34,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 06:31:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 06:31:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-12-25 06:31:34,454 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 06:31:38,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:31:42,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:31:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:31:43,941 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2023-12-25 06:31:43,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-25 06:31:43,957 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 49 [2023-12-25 06:31:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:31:43,958 INFO L225 Difference]: With dead ends: 72 [2023-12-25 06:31:43,959 INFO L226 Difference]: Without dead ends: 60 [2023-12-25 06:31:43,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2023-12-25 06:31:43,960 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 66 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:31:43,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 292 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 281 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2023-12-25 06:31:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-25 06:31:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-12-25 06:31:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.225) internal successors, (49), 43 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2023-12-25 06:31:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2023-12-25 06:31:43,971 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 49 [2023-12-25 06:31:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:31:43,972 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2023-12-25 06:31:43,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 06:31:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2023-12-25 06:31:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 06:31:43,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:31:43,990 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 06:31:44,014 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 (5)] Ended with exit code 0 [2023-12-25 06:31:44,193 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-25 06:31:44,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:31:44,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:31:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash -140605299, now seen corresponding path program 1 times [2023-12-25 06:31:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:31:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828329045] [2023-12-25 06:31:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:31:44,195 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-25 06:31:44,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:31:44,197 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-25 06:31:44,238 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-25 06:31:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:31:44,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-25 06:31:44,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:31:44,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 06:31:44,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-25 06:31:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 06:31:44,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:31:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-25 06:31:45,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:31:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828329045] [2023-12-25 06:31:45,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828329045] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:31:45,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:31:45,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 13 [2023-12-25 06:31:45,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695743787] [2023-12-25 06:31:45,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:31:45,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-25 06:31:45,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:31:45,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-25 06:31:45,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-25 06:31:45,072 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 06:31:49,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:31:53,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:31:57,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:32:01,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:32:05,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:32:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:32:05,846 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2023-12-25 06:32:05,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 06:32:05,849 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 49 [2023-12-25 06:32:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:32:05,851 INFO L225 Difference]: With dead ends: 125 [2023-12-25 06:32:05,851 INFO L226 Difference]: Without dead ends: 106 [2023-12-25 06:32:05,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-25 06:32:05,852 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 25 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2023-12-25 06:32:05,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 334 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2023-12-25 06:32:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-25 06:32:05,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2023-12-25 06:32:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 69 states have internal predecessors, (80), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (35), 16 states have call predecessors, (35), 13 states have call successors, (35) [2023-12-25 06:32:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2023-12-25 06:32:05,895 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 49 [2023-12-25 06:32:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:32:05,895 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2023-12-25 06:32:05,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-25 06:32:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2023-12-25 06:32:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-25 06:32:05,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:32:05,898 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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, 1, 1, 1] [2023-12-25 06:32:05,916 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-25 06:32:06,101 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-25 06:32:06,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:32:06,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:32:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1138374282, now seen corresponding path program 2 times [2023-12-25 06:32:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:32:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536651966] [2023-12-25 06:32:06,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:32:06,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-25 06:32:06,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:32:06,106 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-25 06:32:06,140 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-25 06:32:06,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:32:06,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:32:06,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-25 06:32:06,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:32:06,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 06:32:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-25 06:32:06,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:32:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-25 06:32:07,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:32:07,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536651966] [2023-12-25 06:32:07,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536651966] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:32:07,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:32:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2023-12-25 06:32:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096640316] [2023-12-25 06:32:07,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:32:07,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-25 06:32:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:32:07,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-25 06:32:07,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2023-12-25 06:32:07,017 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 24 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 10 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) [2023-12-25 06:32:11,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:32:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:32:12,597 INFO L93 Difference]: Finished difference Result 154 states and 223 transitions. [2023-12-25 06:32:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-25 06:32:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 10 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) Word has length 61 [2023-12-25 06:32:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:32:12,600 INFO L225 Difference]: With dead ends: 154 [2023-12-25 06:32:12,600 INFO L226 Difference]: Without dead ends: 133 [2023-12-25 06:32:12,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=1284, Unknown=0, NotChecked=0, Total=1482 [2023-12-25 06:32:12,601 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 72 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-25 06:32:12,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 809 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 585 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-12-25 06:32:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-25 06:32:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 100. [2023-12-25 06:32:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 73 states have internal predecessors, (86), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2023-12-25 06:32:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2023-12-25 06:32:12,647 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 61 [2023-12-25 06:32:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:32:12,647 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2023-12-25 06:32:12,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 10 states have call successors, (15), 3 states have call predecessors, (15), 9 states have return successors, (14), 12 states have call predecessors, (14), 9 states have call successors, (14) [2023-12-25 06:32:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2023-12-25 06:32:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-25 06:32:12,650 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:32:12,650 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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, 1, 1] [2023-12-25 06:32:12,665 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-25 06:32:12,853 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-25 06:32:12,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:32:12,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:32:12,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1709892589, now seen corresponding path program 2 times [2023-12-25 06:32:12,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:32:12,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466901006] [2023-12-25 06:32:12,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:32:12,855 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-25 06:32:12,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:32:12,857 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-25 06:32:12,872 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-25 06:32:13,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:32:13,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:32:13,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-25 06:32:13,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:32:14,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 59 [2023-12-25 06:32:14,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 35 [2023-12-25 06:32:14,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 06:32:14,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 38 [2023-12-25 06:32:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-25 06:32:14,657 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:32:15,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 112 [2023-12-25 06:32:15,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 64 [2023-12-25 06:32:16,930 INFO L349 Elim1Store]: treesize reduction 73, result has 81.4 percent of original size [2023-12-25 06:32:16,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 339 [2023-12-25 06:32:46,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:32:46,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466901006] [2023-12-25 06:32:46,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466901006] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:32:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1197011121] [2023-12-25 06:32:46,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 06:32:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:32:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:32:47,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:32:47,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-12-25 06:32:47,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 06:32:47,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:32:47,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-25 06:32:47,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:32:47,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-25 06:32:47,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-25 06:32:47,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-25 06:32:47,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-25 06:32:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-25 06:32:48,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:32:50,651 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-25 06:32:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1197011121] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 06:32:50,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-25 06:32:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 14] total 43 [2023-12-25 06:32:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423482251] [2023-12-25 06:32:50,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-25 06:32:50,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-25 06:32:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:32:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-25 06:32:50,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2920, Unknown=5, NotChecked=0, Total=3080 [2023-12-25 06:32:50,654 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 43 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 31 states have internal predecessors, (80), 14 states have call successors, (22), 10 states have call predecessors, (22), 11 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) [2023-12-25 06:33:00,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:34:05,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:34:15,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:35:24,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:35:28,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:42,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:46,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:50,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:54,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:36:58,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:02,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:06,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:10,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-25 06:37:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:10,531 INFO L93 Difference]: Finished difference Result 332 states and 557 transitions. [2023-12-25 06:37:10,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-12-25 06:37:10,533 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 31 states have internal predecessors, (80), 14 states have call successors, (22), 10 states have call predecessors, (22), 11 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) Word has length 62 [2023-12-25 06:37:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:10,537 INFO L225 Difference]: With dead ends: 332 [2023-12-25 06:37:10,537 INFO L226 Difference]: Without dead ends: 235 [2023-12-25 06:37:10,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 168 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3405 ImplicationChecksByTransitivity, 227.8s TimeCoverageRelationStatistics Valid=1107, Invalid=13846, Unknown=53, NotChecked=0, Total=15006 [2023-12-25 06:37:10,543 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 352 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 164 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.2s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:10,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 375 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2138 Invalid, 22 Unknown, 0 Unchecked, 57.2s Time] [2023-12-25 06:37:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-12-25 06:37:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 194. [2023-12-25 06:37:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 133 states have (on average 1.255639097744361) internal successors, (167), 144 states have internal predecessors, (167), 31 states have call successors, (31), 14 states have call predecessors, (31), 29 states have return successors, (138), 35 states have call predecessors, (138), 23 states have call successors, (138) [2023-12-25 06:37:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 336 transitions. [2023-12-25 06:37:10,579 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 336 transitions. Word has length 62 [2023-12-25 06:37:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:10,579 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 336 transitions. [2023-12-25 06:37:10,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 37 states have (on average 2.1621621621621623) internal successors, (80), 31 states have internal predecessors, (80), 14 states have call successors, (22), 10 states have call predecessors, (22), 11 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) [2023-12-25 06:37:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 336 transitions. [2023-12-25 06:37:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-25 06:37:10,583 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:10,583 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 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] [2023-12-25 06:37:10,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:10,792 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-25 06:37:10,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-25 06:37:10,994 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:10,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1801360064, now seen corresponding path program 3 times [2023-12-25 06:37:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102856240] [2023-12-25 06:37:10,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:37:10,995 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-25 06:37:10,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:10,995 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-25 06:37:10,997 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-25 06:37:11,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-25 06:37:11,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:11,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-25 06:37:11,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:11,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-25 06:37:12,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2023-12-25 06:37:12,763 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-25 06:37:12,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-25 06:37:12,990 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-25 06:37:12,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 47 [2023-12-25 06:37:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 06:37:13,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:14,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 112 [2023-12-25 06:37:14,589 INFO L349 Elim1Store]: treesize reduction 296, result has 0.3 percent of original size [2023-12-25 06:37:14,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 176 treesize of output 1 [2023-12-25 06:37:15,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 06:37:15,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102856240] [2023-12-25 06:37:15,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102856240] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:15,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [959095064] [2023-12-25 06:37:15,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 06:37:15,906 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 06:37:15,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 06:37:15,908 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 06:37:15,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-25 06:37:16,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-25 06:37:16,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 06:37:16,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-25 06:37:16,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:16,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 06:37:16,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 06:37:16,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 06:37:16,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-25 06:37:16,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-25 06:37:18,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2023-12-25 06:37:18,147 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-25 06:37:18,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-25 06:37:18,225 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-12-25 06:37:18,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 47 [2023-12-25 06:37:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-25 06:37:18,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [959095064] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 06:37:19,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 06:37:19,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 39 [2023-12-25 06:37:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770466999] [2023-12-25 06:37:19,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 06:37:19,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-25 06:37:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 06:37:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-25 06:37:19,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2836, Unknown=0, NotChecked=0, Total=3080 [2023-12-25 06:37:19,488 INFO L87 Difference]: Start difference. First operand 194 states and 336 transitions. Second operand has 39 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 29 states have internal predecessors, (49), 12 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-12-25 06:37:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 06:37:25,921 INFO L93 Difference]: Finished difference Result 290 states and 528 transitions. [2023-12-25 06:37:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 06:37:25,924 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 29 states have internal predecessors, (49), 12 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) Word has length 74 [2023-12-25 06:37:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 06:37:25,929 INFO L225 Difference]: With dead ends: 290 [2023-12-25 06:37:25,929 INFO L226 Difference]: Without dead ends: 288 [2023-12-25 06:37:25,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=565, Invalid=6077, Unknown=0, NotChecked=0, Total=6642 [2023-12-25 06:37:25,931 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 138 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-25 06:37:25,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 233 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-25 06:37:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-12-25 06:37:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 222. [2023-12-25 06:37:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 154 states have (on average 1.2467532467532467) internal successors, (192), 165 states have internal predecessors, (192), 35 states have call successors, (35), 17 states have call predecessors, (35), 32 states have return successors, (156), 39 states have call predecessors, (156), 24 states have call successors, (156) [2023-12-25 06:37:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 383 transitions. [2023-12-25 06:37:25,977 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 383 transitions. Word has length 74 [2023-12-25 06:37:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 06:37:25,977 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 383 transitions. [2023-12-25 06:37:25,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 29 states have internal predecessors, (49), 12 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-12-25 06:37:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 383 transitions. [2023-12-25 06:37:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-25 06:37:25,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 06:37:25,978 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 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-25 06:37:25,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-25 06:37:26,196 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-25 06:37:26,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-25 06:37:26,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting checkErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 06:37:26,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 06:37:26,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1299718097, now seen corresponding path program 1 times [2023-12-25 06:37:26,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 06:37:26,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211603941] [2023-12-25 06:37:26,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 06:37:26,390 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-25 06:37:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 06:37:26,395 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-25 06:37:26,396 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-25 06:37:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 06:37:26,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-25 06:37:26,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 06:37:26,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-25 06:37:27,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2023-12-25 06:37:27,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 06:37:27,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 38 [2023-12-25 06:37:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 06:37:27,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 06:37:28,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 112 [2023-12-25 06:37:28,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-25 06:37:28,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 1 [2023-12-25 06:37:28,741 INFO L349 Elim1Store]: treesize reduction 73, result has 81.4 percent of original size [2023-12-25 06:37:28,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 339 Received shutdown request... [2023-12-25 06:46:05,652 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location checkErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 06:46:05,656 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 (12)] Ended with exit code 0 [2023-12-25 06:46:05,679 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-25 06:46:05,679 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 06:46:05,853 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-25 06:46:05,853 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-12-3-2-2-2-1 context. [2023-12-25 06:46:05,857 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2023-12-25 06:46:05,859 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 06:46:05,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 06:46:05 BoogieIcfgContainer [2023-12-25 06:46:05,862 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 06:46:05,863 INFO L158 Benchmark]: Toolchain (without parser) took 881743.43ms. Allocated memory was 248.5MB in the beginning and 518.0MB in the end (delta: 269.5MB). Free memory was 196.7MB in the beginning and 333.6MB in the end (delta: -136.8MB). Peak memory consumption was 307.2MB. Max. memory is 8.0GB. [2023-12-25 06:46:05,865 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 189.8MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 06:46:05,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.11ms. Allocated memory is still 248.5MB. Free memory was 196.2MB in the beginning and 183.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 06:46:05,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.65ms. Allocated memory is still 248.5MB. Free memory was 183.6MB in the beginning and 182.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 06:46:05,866 INFO L158 Benchmark]: Boogie Preprocessor took 50.40ms. Allocated memory is still 248.5MB. Free memory was 182.1MB in the beginning and 179.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-25 06:46:05,866 INFO L158 Benchmark]: RCFGBuilder took 313.99ms. Allocated memory is still 248.5MB. Free memory was 179.4MB in the beginning and 162.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-25 06:46:05,866 INFO L158 Benchmark]: TraceAbstraction took 881102.16ms. Allocated memory was 248.5MB in the beginning and 518.0MB in the end (delta: 269.5MB). Free memory was 162.1MB in the beginning and 333.6MB in the end (delta: -171.5MB). Peak memory consumption was 272.6MB. Max. memory is 8.0GB. [2023-12-25 06:46:05,870 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.17ms. Allocated memory is still 189.8MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.11ms. Allocated memory is still 248.5MB. Free memory was 196.2MB in the beginning and 183.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.65ms. Allocated memory is still 248.5MB. Free memory was 183.6MB in the beginning and 182.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.40ms. Allocated memory is still 248.5MB. Free memory was 182.1MB in the beginning and 179.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 313.99ms. Allocated memory is still 248.5MB. Free memory was 179.4MB in the beginning and 162.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 881102.16ms. Allocated memory was 248.5MB in the beginning and 518.0MB in the end (delta: 269.5MB). Free memory was 162.1MB in the beginning and 333.6MB in the end (delta: -171.5MB). Peak memory consumption was 272.6MB. 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: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was analyzing trace of length 76 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-12-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 881.1s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 304.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 776 SdHoareTripleChecker+Valid, 96.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 767 mSDsluCounter, 2806 SdHoareTripleChecker+Invalid, 94.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2517 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5056 IncrementalHoareTripleChecker+Invalid, 5425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 289 mSDtfsCounter, 5056 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1013 GetRequests, 678 SyntacticMatches, 8 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6053 ImplicationChecksByTransitivity, 239.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=8, InterpolantAutomatonStates: 195, 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, 8 MinimizatonAttempts, 174 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 53.2s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 771 ConstructedInterpolants, 164 QuantifiedInterpolants, 10258 SizeOfPredicates, 194 NumberOfNonLiveVariables, 2039 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 514/650 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