./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99f56435514dfb65050e134544a3df48473421e68ddf59d06d83a7f80b49dbfa --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:14:43,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:14:43,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:14:43,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:14:43,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:14:43,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:14:43,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:14:43,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:14:43,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:14:43,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:14:43,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:14:43,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:14:43,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:14:43,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:14:43,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:14:43,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:14:43,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:14:43,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:14:43,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:14:43,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:14:43,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:14:43,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:14:43,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:14:43,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:14:43,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:14:43,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:14:43,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:14:43,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:14:43,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:14:43,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:14:43,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:14:43,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:14:43,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:14:43,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:14:43,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:14:43,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:14:43,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:14:43,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:14:43,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:14:43,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:14:43,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:14:43,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:14:43,626 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99f56435514dfb65050e134544a3df48473421e68ddf59d06d83a7f80b49dbfa [2024-11-20 02:14:43,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:14:43,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:14:43,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:14:43,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:14:43,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:14:43,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i [2024-11-20 02:14:45,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:14:45,318 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:14:45,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i [2024-11-20 02:14:45,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa45d904/34695721d312426b8597ef8f1fd87885/FLAGc316dd0f7 [2024-11-20 02:14:45,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa45d904/34695721d312426b8597ef8f1fd87885 [2024-11-20 02:14:45,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:14:45,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:14:45,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:14:45,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:14:45,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:14:45,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:45,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3828c866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45, skipping insertion in model container [2024-11-20 02:14:45,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:45,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:14:45,882 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i[919,932] [2024-11-20 02:14:45,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:14:45,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:14:45,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i[919,932] [2024-11-20 02:14:45,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:14:45,980 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:14:45,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45 WrapperNode [2024-11-20 02:14:45,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:14:45,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:14:45,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:14:45,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:14:45,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:45,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,035 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-20 02:14:46,035 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:14:46,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:14:46,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:14:46,036 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:14:46,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,082 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:14:46,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:14:46,104 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:14:46,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:14:46,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:14:46,105 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (1/1) ... [2024-11-20 02:14:46,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:14:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:14:46,135 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) [2024-11-20 02:14:46,138 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 [2024-11-20 02:14:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:14:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:14:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:14:46,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:14:46,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:14:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:14:46,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:14:46,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:14:46,504 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 02:14:46,505 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:14:46,516 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:14:46,517 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:14:46,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:14:46 BoogieIcfgContainer [2024-11-20 02:14:46,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:14:46,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:14:46,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:14:46,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:14:46,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:14:45" (1/3) ... [2024-11-20 02:14:46,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768a6694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:14:46, skipping insertion in model container [2024-11-20 02:14:46,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:45" (2/3) ... [2024-11-20 02:14:46,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768a6694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:14:46, skipping insertion in model container [2024-11-20 02:14:46,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:14:46" (3/3) ... [2024-11-20 02:14:46,526 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-35.i [2024-11-20 02:14:46,538 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:14:46,538 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:14:46,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:14:46,602 INFO L333 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, 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;@40a9c55e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:14:46,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:14:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:14:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-20 02:14:46,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:46,620 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:46,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2077577273, now seen corresponding path program 1 times [2024-11-20 02:14:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:14:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885578661] [2024-11-20 02:14:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:14:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:14:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:14:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:14:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:14:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:14:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:14:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:14:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:14:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:14:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 02:14:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 02:14:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 02:14:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 02:14:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:14:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:14:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:14:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 02:14:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 02:14:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 02:14:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 02:14:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:14:46,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:14:46,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885578661] [2024-11-20 02:14:46,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885578661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:14:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:14:46,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:14:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376621376] [2024-11-20 02:14:46,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:14:46,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:14:46,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:14:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:14:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:14:46,980 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:14:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:14:47,004 INFO L93 Difference]: Finished difference Result 131 states and 220 transitions. [2024-11-20 02:14:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:14:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2024-11-20 02:14:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:14:47,011 INFO L225 Difference]: With dead ends: 131 [2024-11-20 02:14:47,012 INFO L226 Difference]: Without dead ends: 65 [2024-11-20 02:14:47,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:14:47,017 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:14:47,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:14:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-20 02:14:47,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-20 02:14:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:14:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-11-20 02:14:47,049 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 133 [2024-11-20 02:14:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:14:47,049 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-11-20 02:14:47,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:14:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-11-20 02:14:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 02:14:47,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:47,052 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:47,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:14:47,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:47,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash 885089004, now seen corresponding path program 1 times [2024-11-20 02:14:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:14:47,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547577849] [2024-11-20 02:14:47,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:14:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:14:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:14:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:14:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:14:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:14:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:14:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:14:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:14:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:14:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 02:14:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 02:14:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 02:14:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 02:14:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:14:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:14:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:14:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 02:14:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 02:14:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 02:14:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 02:14:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:14:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:14:47,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547577849] [2024-11-20 02:14:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547577849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:14:47,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:14:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:14:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921509636] [2024-11-20 02:14:47,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:14:47,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:14:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:14:47,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:14:47,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:14:47,320 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:14:47,416 INFO L93 Difference]: Finished difference Result 162 states and 235 transitions. [2024-11-20 02:14:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:14:47,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-20 02:14:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:14:47,420 INFO L225 Difference]: With dead ends: 162 [2024-11-20 02:14:47,420 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 02:14:47,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:14:47,422 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 43 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:14:47,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 181 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:14:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 02:14:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-20 02:14:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 02:14:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-20 02:14:47,448 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 134 [2024-11-20 02:14:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:14:47,449 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-20 02:14:47,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-20 02:14:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 02:14:47,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:47,452 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:47,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:14:47,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:47,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash 75742378, now seen corresponding path program 1 times [2024-11-20 02:14:47,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:14:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459721929] [2024-11-20 02:14:47,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:14:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:14:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:14:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:14:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:14:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:14:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:14:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:14:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:14:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:14:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 02:14:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 02:14:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 02:14:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 02:14:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:14:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:14:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:14:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 02:14:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 02:14:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 02:14:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 02:14:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:14:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:14:47,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459721929] [2024-11-20 02:14:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459721929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:14:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:14:47,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:14:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109324081] [2024-11-20 02:14:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:14:47,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:14:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:14:47,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:14:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:14:47,761 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:14:47,952 INFO L93 Difference]: Finished difference Result 317 states and 458 transitions. [2024-11-20 02:14:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:14:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-20 02:14:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:14:47,958 INFO L225 Difference]: With dead ends: 317 [2024-11-20 02:14:47,958 INFO L226 Difference]: Without dead ends: 223 [2024-11-20 02:14:47,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:14:47,960 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 157 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:14:47,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 262 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:14:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-20 02:14:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 121. [2024-11-20 02:14:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 92 states have internal predecessors, (124), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-20 02:14:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2024-11-20 02:14:47,977 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 134 [2024-11-20 02:14:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:14:47,977 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2024-11-20 02:14:47,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2024-11-20 02:14:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 02:14:47,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:47,979 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:47,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:14:47,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1143254442, now seen corresponding path program 1 times [2024-11-20 02:14:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:14:47,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077804330] [2024-11-20 02:14:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:47,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:14:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:14:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:14:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:14:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:14:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:14:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:14:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:14:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:14:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:14:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 02:14:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 02:14:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 02:14:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 02:14:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:14:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:14:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:14:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 02:14:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 02:14:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 02:14:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 02:14:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:14:48,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:14:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077804330] [2024-11-20 02:14:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077804330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:14:48,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:14:48,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:14:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729047661] [2024-11-20 02:14:48,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:14:48,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:14:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:14:48,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:14:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:14:48,298 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:14:48,409 INFO L93 Difference]: Finished difference Result 383 states and 562 transitions. [2024-11-20 02:14:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:14:48,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-20 02:14:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:14:48,413 INFO L225 Difference]: With dead ends: 383 [2024-11-20 02:14:48,413 INFO L226 Difference]: Without dead ends: 265 [2024-11-20 02:14:48,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:14:48,415 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:14:48,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 281 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:14:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-20 02:14:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 237. [2024-11-20 02:14:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 178 states have (on average 1.3651685393258426) internal successors, (243), 180 states have internal predecessors, (243), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 02:14:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 351 transitions. [2024-11-20 02:14:48,452 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 351 transitions. Word has length 134 [2024-11-20 02:14:48,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:14:48,454 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 351 transitions. [2024-11-20 02:14:48,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 351 transitions. [2024-11-20 02:14:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 02:14:48,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:48,458 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:48,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:14:48,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:48,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 122186088, now seen corresponding path program 1 times [2024-11-20 02:14:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:14:48,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417744693] [2024-11-20 02:14:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:14:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:14:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:14:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:14:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:14:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:14:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:14:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:14:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 02:14:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:14:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 02:14:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 02:14:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 02:14:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 02:14:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 02:14:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 02:14:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 02:14:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 02:14:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 02:14:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 02:14:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 02:14:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:14:48,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:14:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417744693] [2024-11-20 02:14:48,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417744693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:14:48,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:14:48,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:14:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823722681] [2024-11-20 02:14:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:14:48,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:14:48,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:14:48,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:14:48,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:14:48,729 INFO L87 Difference]: Start difference. First operand 237 states and 351 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:14:48,909 INFO L93 Difference]: Finished difference Result 553 states and 793 transitions. [2024-11-20 02:14:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:14:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2024-11-20 02:14:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:14:48,914 INFO L225 Difference]: With dead ends: 553 [2024-11-20 02:14:48,915 INFO L226 Difference]: Without dead ends: 435 [2024-11-20 02:14:48,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:14:48,917 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 129 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:14:48,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 408 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:14:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-20 02:14:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 333. [2024-11-20 02:14:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 230 states have (on average 1.2826086956521738) internal successors, (295), 234 states have internal predecessors, (295), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 90 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-20 02:14:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 483 transitions. [2024-11-20 02:14:48,963 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 483 transitions. Word has length 134 [2024-11-20 02:14:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:14:48,964 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 483 transitions. [2024-11-20 02:14:48,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 483 transitions. [2024-11-20 02:14:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-20 02:14:48,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:48,965 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:48,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:14:48,966 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:48,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash -687160538, now seen corresponding path program 1 times [2024-11-20 02:14:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:14:48,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601077379] [2024-11-20 02:14:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:48,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:14:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:14:49,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326638955] [2024-11-20 02:14:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:49,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:14:49,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:14:49,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:14:49,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:14:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:14:49,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:14:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:14:49,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:14:49,247 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:14:49,248 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:14:49,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 02:14:49,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 02:14:49,472 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 02:14:49,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:14:49,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:14:49 BoogieIcfgContainer [2024-11-20 02:14:49,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:14:49,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:14:49,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:14:49,545 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:14:49,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:14:46" (3/4) ... [2024-11-20 02:14:49,547 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:14:49,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:14:49,549 INFO L158 Benchmark]: Toolchain (without parser) took 3846.29ms. Allocated memory was 138.4MB in the beginning and 230.7MB in the end (delta: 92.3MB). Free memory was 84.7MB in the beginning and 185.2MB in the end (delta: -100.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:14:49,549 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:14:49,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.92ms. Allocated memory is still 138.4MB. Free memory was 84.3MB in the beginning and 68.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 02:14:49,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.90ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 68.6MB in the beginning and 161.7MB in the end (delta: -93.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-20 02:14:49,550 INFO L158 Benchmark]: Boogie Preprocessor took 67.81ms. Allocated memory is still 190.8MB. Free memory was 161.7MB in the beginning and 159.1MB in the end (delta: 2.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-20 02:14:49,550 INFO L158 Benchmark]: RCFGBuilder took 412.68ms. Allocated memory is still 190.8MB. Free memory was 159.1MB in the beginning and 138.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 02:14:49,550 INFO L158 Benchmark]: TraceAbstraction took 3025.64ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 137.1MB in the beginning and 185.2MB in the end (delta: -48.0MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2024-11-20 02:14:49,550 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 230.7MB. Free memory is still 185.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:14:49,555 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.13ms. Allocated memory is still 138.4MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.92ms. Allocated memory is still 138.4MB. Free memory was 84.3MB in the beginning and 68.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.90ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 68.6MB in the beginning and 161.7MB in the end (delta: -93.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.81ms. Allocated memory is still 190.8MB. Free memory was 161.7MB in the beginning and 159.1MB in the end (delta: 2.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * RCFGBuilder took 412.68ms. Allocated memory is still 190.8MB. Free memory was 159.1MB in the beginning and 138.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3025.64ms. Allocated memory was 190.8MB in the beginning and 230.7MB in the end (delta: 39.8MB). Free memory was 137.1MB in the beginning and 185.2MB in the end (delta: -48.0MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 230.7MB. Free memory is still 185.2MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someUnaryFLOAToperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] signed short int last_1_var_1_12 = 2; [L44] signed long int last_1_var_1_13 = -256; [L45] double last_1_var_1_14 = 127.75; [L46] unsigned char last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L123] last_1_var_1_12 = var_1_12 [L124] last_1_var_1_13 = var_1_13 [L125] last_1_var_1_14 = var_1_14 [L126] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L136] RET updateLastVariables() [L137] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L89] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L91] var_1_4 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L92] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L93] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L93] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L94] var_1_5 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L95] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L96] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L96] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L97] var_1_9 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L98] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L99] var_1_11 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L100] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L101] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L101] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L102] var_1_15 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L103] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L104] var_1_17 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L105] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L106] var_1_18 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L107] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L108] var_1_19 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L109] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L110] var_1_20 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L111] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L112] var_1_22 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L113] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L114] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L114] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L115] var_1_24 = __VERIFIER_nondet_short() [L116] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L116] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L117] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L117] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L118] var_1_25 = __VERIFIER_nondet_short() [L119] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L119] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L120] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L120] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L137] RET updateVariables() [L138] CALL step() [L50] COND FALSE !(\read(last_1_var_1_21)) [L53] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L55] COND TRUE var_1_18 > var_1_9 [L56] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L60] COND TRUE last_1_var_1_12 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L61] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L62] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L69] COND FALSE !(var_1_11 > var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L72] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L72] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L73] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L77] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L78] COND FALSE !(var_1_11 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L81] COND FALSE !(var_1_6 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L129-L130] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 419 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 419 mSDsluCounter, 1227 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 626 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 601 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 235 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 1063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3800/3800 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: unable to determine feasibility of some traces [2024-11-20 02:14:49,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 99f56435514dfb65050e134544a3df48473421e68ddf59d06d83a7f80b49dbfa --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:14:51,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:14:51,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:14:51,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:14:51,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:14:51,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:14:51,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:14:51,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:14:51,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:14:51,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:14:51,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:14:51,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:14:51,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:14:51,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:14:51,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:14:51,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:14:51,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:14:51,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:14:51,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:14:51,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:14:51,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:14:51,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:14:51,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:14:51,569 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:14:51,570 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:14:51,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:14:51,570 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:14:51,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:14:51,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:14:51,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:14:51,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:14:51,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:14:51,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:14:51,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:14:51,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:14:51,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:14:51,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:14:51,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:14:51,573 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:14:51,573 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:14:51,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:14:51,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:14:51,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:14:51,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:14:51,574 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 99f56435514dfb65050e134544a3df48473421e68ddf59d06d83a7f80b49dbfa [2024-11-20 02:14:51,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:14:51,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:14:51,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:14:51,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:14:51,878 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:14:51,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i [2024-11-20 02:14:53,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:14:53,461 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:14:53,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i [2024-11-20 02:14:53,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5771a2bfe/16d43f3372f5495d9324a270aa05a55f/FLAGfa547e7e3 [2024-11-20 02:14:53,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5771a2bfe/16d43f3372f5495d9324a270aa05a55f [2024-11-20 02:14:53,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:14:53,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:14:53,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:14:53,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:14:53,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:14:53,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:14:53" (1/1) ... [2024-11-20 02:14:53,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71044059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:53, skipping insertion in model container [2024-11-20 02:14:53,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:14:53" (1/1) ... [2024-11-20 02:14:53,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:14:54,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i[919,932] [2024-11-20 02:14:54,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:14:54,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:14:54,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-35.i[919,932] [2024-11-20 02:14:54,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:14:54,163 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:14:54,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54 WrapperNode [2024-11-20 02:14:54,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:14:54,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:14:54,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:14:54,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:14:54,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,212 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-11-20 02:14:54,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:14:54,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:14:54,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:14:54,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:14:54,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,244 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:14:54,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:14:54,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:14:54,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:14:54,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:14:54,273 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (1/1) ... [2024-11-20 02:14:54,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:14:54,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:14:54,303 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) [2024-11-20 02:14:54,305 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 [2024-11-20 02:14:54,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:14:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:14:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:14:54,338 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:14:54,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:14:54,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:14:54,398 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:14:54,400 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:14:55,990 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:14:55,990 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:14:56,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:14:56,004 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:14:56,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:14:56 BoogieIcfgContainer [2024-11-20 02:14:56,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:14:56,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:14:56,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:14:56,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:14:56,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:14:53" (1/3) ... [2024-11-20 02:14:56,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450b42be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:14:56, skipping insertion in model container [2024-11-20 02:14:56,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:14:54" (2/3) ... [2024-11-20 02:14:56,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450b42be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:14:56, skipping insertion in model container [2024-11-20 02:14:56,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:14:56" (3/3) ... [2024-11-20 02:14:56,015 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-35.i [2024-11-20 02:14:56,032 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:14:56,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:14:56,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:14:56,084 INFO L333 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, 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;@5ee02edf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:14:56,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:14:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:14:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 02:14:56,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:56,099 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:56,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:56,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash 552370106, now seen corresponding path program 1 times [2024-11-20 02:14:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:14:56,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241593790] [2024-11-20 02:14:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:56,118 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 [2024-11-20 02:14:56,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:14:56,120 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) [2024-11-20 02:14:56,121 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 [2024-11-20 02:14:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:56,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:14:56,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:14:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-20 02:14:56,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:14:56,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:14:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241593790] [2024-11-20 02:14:56,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241593790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:14:56,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:14:56,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:14:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391818391] [2024-11-20 02:14:56,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:14:56,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:14:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:14:56,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:14:56,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:14:56,470 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:14:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:14:56,495 INFO L93 Difference]: Finished difference Result 117 states and 200 transitions. [2024-11-20 02:14:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:14:56,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 130 [2024-11-20 02:14:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:14:56,503 INFO L225 Difference]: With dead ends: 117 [2024-11-20 02:14:56,503 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 02:14:56,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:14:56,508 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:14:56,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:14:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 02:14:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-20 02:14:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 02:14:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-20 02:14:56,542 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 130 [2024-11-20 02:14:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:14:56,543 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-20 02:14:56,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 02:14:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-20 02:14:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-20 02:14:56,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:56,546 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:56,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:14:56,746 WARN L453 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 [2024-11-20 02:14:56,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:56,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1808280681, now seen corresponding path program 1 times [2024-11-20 02:14:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:14:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552588990] [2024-11-20 02:14:56,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:56,748 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 [2024-11-20 02:14:56,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:14:56,750 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) [2024-11-20 02:14:56,751 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 [2024-11-20 02:14:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:57,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 02:14:57,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:14:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:14:57,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:14:57,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:14:57,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552588990] [2024-11-20 02:14:57,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552588990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:14:57,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:14:57,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:14:57,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266186786] [2024-11-20 02:14:57,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:14:57,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:14:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:14:57,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:14:57,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:14:57,319 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:14:58,784 INFO L93 Difference]: Finished difference Result 184 states and 272 transitions. [2024-11-20 02:14:58,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:14:58,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-20 02:14:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:14:58,799 INFO L225 Difference]: With dead ends: 184 [2024-11-20 02:14:58,799 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 02:14:58,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:14:58,801 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 77 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:14:58,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 259 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 02:14:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 02:14:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2024-11-20 02:14:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.25) internal successors, (85), 68 states have internal predecessors, (85), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 02:14:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2024-11-20 02:14:58,834 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 131 [2024-11-20 02:14:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:14:58,835 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2024-11-20 02:14:58,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:14:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2024-11-20 02:14:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-20 02:14:58,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:14:58,837 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:14:58,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 02:14:59,038 WARN L453 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 [2024-11-20 02:14:59,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:14:59,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:14:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1899880601, now seen corresponding path program 1 times [2024-11-20 02:14:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:14:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625573901] [2024-11-20 02:14:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:14:59,041 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 [2024-11-20 02:14:59,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:14:59,042 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) [2024-11-20 02:14:59,043 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 [2024-11-20 02:14:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:14:59,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 02:14:59,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:14:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 02:14:59,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:14:59,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:14:59,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625573901] [2024-11-20 02:14:59,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625573901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:14:59,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:14:59,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:14:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611902575] [2024-11-20 02:14:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:14:59,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:14:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:14:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:14:59,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:14:59,337 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:15:00,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:15:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:15:03,023 INFO L93 Difference]: Finished difference Result 328 states and 484 transitions. [2024-11-20 02:15:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:15:03,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-20 02:15:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:15:03,034 INFO L225 Difference]: With dead ends: 328 [2024-11-20 02:15:03,034 INFO L226 Difference]: Without dead ends: 273 [2024-11-20 02:15:03,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:15:03,038 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 134 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-20 02:15:03,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 240 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-20 02:15:03,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-20 02:15:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 163. [2024-11-20 02:15:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 106 states have internal predecessors, (131), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 02:15:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2024-11-20 02:15:03,076 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 131 [2024-11-20 02:15:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:15:03,078 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2024-11-20 02:15:03,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 02:15:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2024-11-20 02:15:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-20 02:15:03,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:15:03,080 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:15:03,090 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 [2024-11-20 02:15:03,280 WARN L453 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 [2024-11-20 02:15:03,281 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:15:03,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:15:03,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1957138903, now seen corresponding path program 1 times [2024-11-20 02:15:03,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:15:03,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663566077] [2024-11-20 02:15:03,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:15:03,282 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 [2024-11-20 02:15:03,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:15:03,285 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) [2024-11-20 02:15:03,285 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 [2024-11-20 02:15:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:15:03,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-20 02:15:03,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:16:06,087 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)