./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_fillercode_fillercodestructure_filler-pr-ci_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercode_fillercodestructure_filler-pr-ci_file-2.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 8c967b3ea73611668e07001cededa057f95ebe8c171b4725500e4449faff4d5b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:34:17,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:34:17,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:34:17,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:34:17,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:34:17,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:34:17,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:34:17,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:34:17,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:34:17,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:34:17,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:34:17,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:34:17,676 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:34:17,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:34:17,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:34:17,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:34:17,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:34:17,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:34:17,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:34:17,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:34:17,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:34:17,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:34:17,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:34:17,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:34:17,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:34:17,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:34:17,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:34:17,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:34:17,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:34:17,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:34:17,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:34:17,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:34:17,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:34:17,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:34:17,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:34:17,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:34:17,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:34:17,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:34:17,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:34:17,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:34:17,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:34:17,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:34:17,685 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 -> 8c967b3ea73611668e07001cededa057f95ebe8c171b4725500e4449faff4d5b [2024-10-14 09:34:17,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:34:17,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:34:17,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:34:17,931 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:34:17,931 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:34:17,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2024-10-14 09:34:19,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:34:19,654 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:34:19,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2024-10-14 09:34:19,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9439a0005/0e1ecf0c0ecf48ac8e0ab6c3af899edf/FLAG08ff99fa5 [2024-10-14 09:34:19,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9439a0005/0e1ecf0c0ecf48ac8e0ab6c3af899edf [2024-10-14 09:34:19,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:34:19,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:34:19,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:34:19,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:34:19,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:34:19,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:34:19" (1/1) ... [2024-10-14 09:34:19,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ca63bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:19, skipping insertion in model container [2024-10-14 09:34:19,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:34:19" (1/1) ... [2024-10-14 09:34:19,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:34:19,885 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-2.i[918,931] [2024-10-14 09:34:19,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:34:19,984 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:34:19,995 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-2.i[918,931] [2024-10-14 09:34:20,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:34:20,049 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:34:20,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20 WrapperNode [2024-10-14 09:34:20,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:34:20,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:34:20,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:34:20,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:34:20,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,096 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-10-14 09:34:20,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:34:20,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:34:20,097 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:34:20,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:34:20,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,131 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-10-14 09:34:20,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:34:20,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:34:20,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:34:20,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:34:20,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (1/1) ... [2024-10-14 09:34:20,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:34:20,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:34:20,185 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-10-14 09:34:20,187 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-10-14 09:34:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:34:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:34:20,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:34:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:34:20,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:34:20,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:34:20,280 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:34:20,282 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:34:20,581 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 09:34:20,582 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:34:20,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:34:20,629 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:34:20,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:34:20 BoogieIcfgContainer [2024-10-14 09:34:20,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:34:20,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:34:20,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:34:20,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:34:20,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:34:19" (1/3) ... [2024-10-14 09:34:20,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0c5df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:34:20, skipping insertion in model container [2024-10-14 09:34:20,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:20" (2/3) ... [2024-10-14 09:34:20,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0c5df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:34:20, skipping insertion in model container [2024-10-14 09:34:20,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:34:20" (3/3) ... [2024-10-14 09:34:20,641 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2024-10-14 09:34:20,657 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:34:20,657 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:34:20,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:34:20,728 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;@9f155c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:34:20,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:34:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 53 states have internal predecessors, (82), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 09:34:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 09:34:20,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:34:20,746 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:34:20,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:34:20,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:34:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash -733464926, now seen corresponding path program 1 times [2024-10-14 09:34:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:34:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106900696] [2024-10-14 09:34:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:34:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:34:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:34:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:34:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:34:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:34:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:34:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:34:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 09:34:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:34:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 09:34:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:34:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:34:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 09:34:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 09:34:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 09:34:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 09:34:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:34:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 09:34:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:34:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 09:34:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:34:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106900696] [2024-10-14 09:34:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106900696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:34:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:34:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:34:21,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381644437] [2024-10-14 09:34:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:34:21,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:34:21,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:34:21,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:34:21,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:34:21,320 INFO L87 Difference]: Start difference. First operand has 74 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 53 states have internal predecessors, (82), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 09:34:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:34:21,376 INFO L93 Difference]: Finished difference Result 145 states and 257 transitions. [2024-10-14 09:34:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:34:21,379 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 129 [2024-10-14 09:34:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:34:21,387 INFO L225 Difference]: With dead ends: 145 [2024-10-14 09:34:21,388 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 09:34:21,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-10-14 09:34:21,397 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:34:21,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:34:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 09:34:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-14 09:34:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 09:34:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 113 transitions. [2024-10-14 09:34:21,479 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 113 transitions. Word has length 129 [2024-10-14 09:34:21,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:34:21,481 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 113 transitions. [2024-10-14 09:34:21,481 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 09:34:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 113 transitions. [2024-10-14 09:34:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 09:34:21,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:34:21,488 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:34:21,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:34:21,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:34:21,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:34:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1971025252, now seen corresponding path program 1 times [2024-10-14 09:34:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:34:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706052325] [2024-10-14 09:34:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:34:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:34:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:34:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:34:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:34:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:34:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:34:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:34:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 09:34:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:34:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 09:34:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:34:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:34:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 09:34:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 09:34:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 09:34:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 09:34:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:34:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 09:34:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:34:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 09:34:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:34:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706052325] [2024-10-14 09:34:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706052325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:34:21,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:34:21,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:34:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751076356] [2024-10-14 09:34:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:34:21,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:34:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:34:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:34:22,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:34:22,001 INFO L87 Difference]: Start difference. First operand 72 states and 113 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 09:34:22,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:34:22,059 INFO L93 Difference]: Finished difference Result 144 states and 227 transitions. [2024-10-14 09:34:22,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:34:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 130 [2024-10-14 09:34:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:34:22,065 INFO L225 Difference]: With dead ends: 144 [2024-10-14 09:34:22,065 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 09:34:22,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:34:22,067 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:34:22,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:34:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 09:34:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-14 09:34:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 09:34:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2024-10-14 09:34:22,095 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 130 [2024-10-14 09:34:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:34:22,096 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2024-10-14 09:34:22,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 09:34:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2024-10-14 09:34:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 09:34:22,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:34:22,099 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:34:22,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:34:22,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:34:22,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:34:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash -959908002, now seen corresponding path program 1 times [2024-10-14 09:34:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:34:22,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965536483] [2024-10-14 09:34:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:34:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:34:22,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739449885] [2024-10-14 09:34:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:22,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:34:22,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:34:22,309 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-10-14 09:34:22,321 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-10-14 09:34:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:22,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 09:34:22,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:34:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-14 09:34:23,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:34:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:34:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965536483] [2024-10-14 09:34:23,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 09:34:23,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739449885] [2024-10-14 09:34:23,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739449885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:34:23,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:34:23,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 09:34:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652020555] [2024-10-14 09:34:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:34:23,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:34:23,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:34:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:34:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:34:23,265 INFO L87 Difference]: Start difference. First operand 73 states and 114 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 09:34:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:34:23,673 INFO L93 Difference]: Finished difference Result 206 states and 314 transitions. [2024-10-14 09:34:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:34:23,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 130 [2024-10-14 09:34:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:34:23,677 INFO L225 Difference]: With dead ends: 206 [2024-10-14 09:34:23,679 INFO L226 Difference]: Without dead ends: 134 [2024-10-14 09:34:23,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:34:23,681 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 257 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:34:23,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 164 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:34:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-14 09:34:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2024-10-14 09:34:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 75 states have internal predecessors, (104), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 09:34:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 160 transitions. [2024-10-14 09:34:23,711 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 160 transitions. Word has length 130 [2024-10-14 09:34:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:34:23,712 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 160 transitions. [2024-10-14 09:34:23,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 09:34:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 160 transitions. [2024-10-14 09:34:23,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 09:34:23,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:34:23,718 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:34:23,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:34:23,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:34:23,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:34:23,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:34:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash -902649700, now seen corresponding path program 1 times [2024-10-14 09:34:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:34:23,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618764476] [2024-10-14 09:34:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:23,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:34:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:34:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:34:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:34:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:34:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:34:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:34:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:34:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 09:34:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:34:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 09:34:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:34:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:34:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 09:34:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 09:34:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 09:34:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 09:34:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:34:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 09:34:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:34:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 09:34:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:34:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618764476] [2024-10-14 09:34:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618764476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:34:24,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:34:24,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 09:34:24,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303392177] [2024-10-14 09:34:24,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:34:24,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:34:24,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:34:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:34:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:34:24,350 INFO L87 Difference]: Start difference. First operand 105 states and 160 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 09:34:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:34:24,631 INFO L93 Difference]: Finished difference Result 320 states and 471 transitions. [2024-10-14 09:34:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:34:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 130 [2024-10-14 09:34:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:34:24,636 INFO L225 Difference]: With dead ends: 320 [2024-10-14 09:34:24,638 INFO L226 Difference]: Without dead ends: 232 [2024-10-14 09:34:24,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:34:24,640 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 216 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:34:24,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 327 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:34:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-14 09:34:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 122. [2024-10-14 09:34:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.49) internal successors, (149), 100 states have internal predecessors, (149), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 09:34:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 187 transitions. [2024-10-14 09:34:24,667 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 187 transitions. Word has length 130 [2024-10-14 09:34:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:34:24,668 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 187 transitions. [2024-10-14 09:34:24,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 09:34:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 187 transitions. [2024-10-14 09:34:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-14 09:34:24,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:34:24,673 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:34:24,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:34:24,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:34:24,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:34:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash -902590118, now seen corresponding path program 1 times [2024-10-14 09:34:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:34:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847036736] [2024-10-14 09:34:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:24,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:34:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:34:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:34:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:34:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:34:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:34:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:34:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 09:34:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 09:34:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 09:34:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 09:34:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 09:34:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 09:34:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 09:34:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 09:34:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 09:34:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 09:34:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 09:34:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 09:34:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:25,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 09:34:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 09:34:25,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:34:25,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847036736] [2024-10-14 09:34:25,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847036736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:34:25,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:34:25,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:34:25,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078400245] [2024-10-14 09:34:25,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:34:25,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:34:25,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:34:25,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:34:25,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:34:25,014 INFO L87 Difference]: Start difference. First operand 122 states and 187 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 09:34:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:34:25,186 INFO L93 Difference]: Finished difference Result 267 states and 406 transitions. [2024-10-14 09:34:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:34:25,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 130 [2024-10-14 09:34:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:34:25,189 INFO L225 Difference]: With dead ends: 267 [2024-10-14 09:34:25,189 INFO L226 Difference]: Without dead ends: 135 [2024-10-14 09:34:25,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 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-10-14 09:34:25,193 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 160 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:34:25,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 157 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:34:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-14 09:34:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 103. [2024-10-14 09:34:25,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 81 states have internal predecessors, (118), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 09:34:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 156 transitions. [2024-10-14 09:34:25,223 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 156 transitions. Word has length 130 [2024-10-14 09:34:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:34:25,223 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 156 transitions. [2024-10-14 09:34:25,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 09:34:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 156 transitions. [2024-10-14 09:34:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 09:34:25,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:34:25,227 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:34:25,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:34:25,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:34:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:34:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash -980548131, now seen corresponding path program 1 times [2024-10-14 09:34:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:34:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680928091] [2024-10-14 09:34:25,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:34:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:34:25,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959247666] [2024-10-14 09:34:25,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:25,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:34:25,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:34:25,307 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:34:25,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 09:34:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:34:25,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:34:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:34:25,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:34:25,537 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:34:25,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:34:25,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:34:25,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 09:34:25,744 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 09:34:25,842 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:34:25,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:34:25 BoogieIcfgContainer [2024-10-14 09:34:25,846 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:34:25,846 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:34:25,846 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:34:25,846 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:34:25,847 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:34:20" (3/4) ... [2024-10-14 09:34:25,848 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:34:25,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:34:25,850 INFO L158 Benchmark]: Toolchain (without parser) took 6165.56ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 70.9MB in the beginning and 126.0MB in the end (delta: -55.2MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2024-10-14 09:34:25,850 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 142.6MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:34:25,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.63ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 70.7MB in the beginning and 174.9MB in the end (delta: -104.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-10-14 09:34:25,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.35ms. Allocated memory is still 207.6MB. Free memory was 174.9MB in the beginning and 170.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:34:25,851 INFO L158 Benchmark]: Boogie Preprocessor took 50.38ms. Allocated memory is still 207.6MB. Free memory was 170.8MB in the beginning and 165.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:34:25,851 INFO L158 Benchmark]: RCFGBuilder took 477.69ms. Allocated memory is still 207.6MB. Free memory was 165.5MB in the beginning and 137.2MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 09:34:25,853 INFO L158 Benchmark]: TraceAbstraction took 5212.64ms. Allocated memory was 207.6MB in the beginning and 276.8MB in the end (delta: 69.2MB). Free memory was 137.2MB in the beginning and 126.0MB in the end (delta: 11.2MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. [2024-10-14 09:34:25,853 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 276.8MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:34:25,854 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 142.6MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.63ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 70.7MB in the beginning and 174.9MB in the end (delta: -104.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.35ms. Allocated memory is still 207.6MB. Free memory was 174.9MB in the beginning and 170.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.38ms. Allocated memory is still 207.6MB. Free memory was 170.8MB in the beginning and 165.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 477.69ms. Allocated memory is still 207.6MB. Free memory was 165.5MB in the beginning and 137.2MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5212.64ms. Allocated memory was 207.6MB in the beginning and 276.8MB in the end (delta: 69.2MB). Free memory was 137.2MB in the beginning and 126.0MB in the end (delta: 11.2MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 276.8MB. Free memory is still 126.0MB. 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 169, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of someUnaryDOUBLEoperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryArithmeticFLOAToperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.95; [L23] float var_1_4 = 9999999.8; [L24] float var_1_5 = 8.6; [L25] unsigned long int var_1_6 = 10000; [L26] double var_1_8 = 64.5; [L27] float var_1_10 = 255.25; [L28] float var_1_11 = 7.5; [L29] float var_1_12 = 0.0; [L30] float var_1_13 = 64.8; [L31] double var_1_14 = 127.75; [L32] signed char var_1_15 = 8; [L33] signed char var_1_16 = 32; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 0; [L36] double var_1_19 = 2.25; [L37] unsigned char var_1_20 = 0; [L38] unsigned short int var_1_21 = 256; [L39] float var_1_22 = 256.5; [L40] signed char var_1_27 = -64; [L41] signed char var_1_30 = -10; [L42] unsigned long int var_1_31 = 8; [L43] double var_1_32 = 499.75; [L44] double var_1_36 = 3.15; [L45] unsigned char var_1_38 = 8; [L46] float var_1_40 = 255.8; [L47] signed short int var_1_41 = 256; [L48] signed char var_1_42 = -32; [L49] unsigned long int last_1_var_1_6 = 10000; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_6 = var_1_6 [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L134] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_5=43/5, var_1_6=10000, var_1_8=129/2] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L136] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000, var_1_8=129/2] [L137] var_1_8 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L138] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_11=15/2, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L139] var_1_11 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L140] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L141] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=0, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L142] var_1_12 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L143] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_13=324/5, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L144] var_1_13 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L145] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=8, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L146] var_1_15 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L147] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L148] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=32, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L149] var_1_16 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L150] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L151] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L152] var_1_18 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L153] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L154] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-10, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L155] var_1_30 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L156] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L157] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_36=63/20, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L158] var_1_36 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L159] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 2305843.009213691390e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=-32, var_1_6=10000] [L160] var_1_42 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_42 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L161] RET assume_abort_if_not(var_1_42 >= -128) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L162] CALL assume_abort_if_not(var_1_42 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L162] RET assume_abort_if_not(var_1_42 <= 127) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L163] CALL assume_abort_if_not(var_1_42 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L163] RET assume_abort_if_not(var_1_42 != 0) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_14=511/4, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L177] RET updateVariables() [L178] CALL step() [L53] COND TRUE (var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6 [L54] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L56] COND FALSE !(var_1_6 < (~ var_1_30)) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=1021/4, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_6=10000] [L61] COND TRUE (var_1_5 / var_1_11) >= (var_1_8 - var_1_4) [L62] var_1_10 = (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=0, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L66] var_1_20 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=1999/4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L67] COND FALSE !(var_1_13 == var_1_13) [L74] var_1_32 = (((((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) < 0 ) ? -((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))) : ((((var_1_12 - 9.5) < 0 ) ? -(var_1_12 - 9.5) : (var_1_12 - 9.5))))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_38=8, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L76] COND TRUE ! (var_1_4 <= var_1_36) [L77] var_1_38 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_38=1, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L79] EXPR (var_1_16 >> 4) & var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_38=1, var_1_40=1279/5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L79] COND TRUE 128 != ((var_1_16 >> 4) & var_1_16) [L80] var_1_40 = ((((var_1_36) > (var_1_13)) ? (var_1_36) : (var_1_13))) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=256, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L82] var_1_21 = var_1_16 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L83] COND TRUE var_1_21 <= (var_1_16 * var_1_20) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L84] COND TRUE (var_1_5 + var_1_14) <= 127.025f [L85] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L92] unsigned char stepLocal_0 = var_1_20 != var_1_20; VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=10000] [L93] COND FALSE !(\read(var_1_17)) [L104] var_1_6 = var_1_20 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=1] [L106] COND FALSE !(((var_1_12 + 127.75f) * var_1_13) < var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=1] [L111] COND TRUE var_1_6 <= var_1_6 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=79/20, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_6=1] [L112] COND FALSE !(var_1_6 > var_1_6) [L115] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=1, var_1_21=1, var_1_22=513/2, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L120] COND TRUE var_1_16 >= var_1_20 [L121] var_1_22 = (var_1_13 + var_1_13) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L123] COND FALSE !(var_1_1 < var_1_11) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=256, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L126] COND TRUE (var_1_6 / var_1_42) < var_1_21 [L127] var_1_41 = ((((((((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) < 0 ) ? -((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) : ((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))))) < 0 ) ? -(((((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) < 0 ) ? -((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) : ((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))))) : (((((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) < 0 ) ? -((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))) : ((((var_1_30) > (var_1_21)) ? (var_1_30) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_6=10000, stepLocal_0=0, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=1, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return ((((((((var_1_6 <= var_1_6) ? ((var_1_6 > var_1_6) ? (var_1_1 == ((float) (var_1_4 - var_1_5))) : (var_1_1 == ((float) var_1_5))) : (var_1_1 == ((float) var_1_4))) && (var_1_17 ? ((((((var_1_14) > (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78))))) ? (var_1_14) : (((((var_1_5) > (199.78)) ? (var_1_5) : (199.78)))))) != (var_1_4 - var_1_8)) ? (((var_1_20 != var_1_20) || var_1_17) ? (var_1_6 == ((unsigned long int) var_1_20)) : (var_1_6 == ((unsigned long int) 5u))) : (var_1_6 == ((unsigned long int) var_1_20))) : (var_1_6 == ((unsigned long int) var_1_20)))) && (((var_1_5 / var_1_11) >= (var_1_8 - var_1_4)) ? (var_1_10 == ((float) (((((var_1_5 - (var_1_12 - var_1_13))) < (var_1_4)) ? ((var_1_5 - (var_1_12 - var_1_13))) : (var_1_4))))) : (var_1_10 == ((float) 4.2f)))) && (((var_1_15 - ((((0) < (var_1_16)) ? (0) : (var_1_16)))) > last_1_var_1_6) ? (var_1_14 == ((double) var_1_12)) : 1)) && ((var_1_21 <= (var_1_16 * var_1_20)) ? (((var_1_5 + var_1_14) <= 127.025f) ? (var_1_17 == ((unsigned char) var_1_18)) : (var_1_17 == ((unsigned char) var_1_18))) : (var_1_17 == ((unsigned char) var_1_18)))) && ((var_1_1 < var_1_11) ? (var_1_19 == ((double) (var_1_13 - 256.4))) : 1)) && (var_1_20 == ((unsigned char) var_1_16))) && (var_1_21 == ((unsigned short int) var_1_16)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=1, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=10000, var_1_10=3, var_1_12=2, var_1_13=0, var_1_14=2, var_1_15=-1, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=9/4, var_1_1=6, var_1_20=1, var_1_21=1, var_1_27=-64, var_1_30=-1, var_1_31=8, var_1_32=4, var_1_36=5, var_1_38=1, var_1_40=5, var_1_41=1, var_1_42=2, var_1_4=0, var_1_5=6, var_1_6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 633 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 633 mSDsluCounter, 971 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 434 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 393 IncrementalHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 537 mSDtfsCounter, 393 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 171 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 1041 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 644 ConstructedInterpolants, 0 QuantifiedInterpolants, 1317 SizeOfPredicates, 2 NumberOfNonLiveVariables, 316 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3420/3420 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-10-14 09:34:25,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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_fillercode_fillercodestructure_filler-pr-ci_file-2.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 8c967b3ea73611668e07001cededa057f95ebe8c171b4725500e4449faff4d5b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:34:28,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:34:28,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:34:28,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:34:28,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:34:28,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:34:28,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:34:28,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:34:28,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:34:28,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:34:28,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:34:28,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:34:28,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:34:28,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:34:28,168 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:34:28,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:34:28,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:34:28,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:34:28,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:34:28,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:34:28,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:34:28,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:34:28,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:34:28,173 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:34:28,173 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:34:28,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:34:28,173 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:34:28,174 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:34:28,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:34:28,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:34:28,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:34:28,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:34:28,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:34:28,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:34:28,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:34:28,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:34:28,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:34:28,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:34:28,177 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:34:28,177 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:34:28,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:34:28,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:34:28,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:34:28,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:34:28,179 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:34:28,179 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 -> 8c967b3ea73611668e07001cededa057f95ebe8c171b4725500e4449faff4d5b [2024-10-14 09:34:28,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:34:28,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:34:28,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:34:28,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:34:28,497 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:34:28,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2024-10-14 09:34:29,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:34:30,338 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:34:30,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2024-10-14 09:34:30,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62daf68f3/326009a1293d4f86a02bc4af0298d440/FLAG3dfc56739 [2024-10-14 09:34:30,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62daf68f3/326009a1293d4f86a02bc4af0298d440 [2024-10-14 09:34:30,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:34:30,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:34:30,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:34:30,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:34:30,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:34:30,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:30,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3d60aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30, skipping insertion in model container [2024-10-14 09:34:30,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:30,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:34:30,752 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-2.i[918,931] [2024-10-14 09:34:30,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:34:30,849 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:34:30,861 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-2.i[918,931] [2024-10-14 09:34:30,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:34:30,943 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:34:30,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30 WrapperNode [2024-10-14 09:34:30,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:34:30,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:34:30,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:34:30,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:34:30,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:30,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,000 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-10-14 09:34:31,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:34:31,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:34:31,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:34:31,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:34:31,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,042 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-10-14 09:34:31,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:34:31,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:34:31,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:34:31,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:34:31,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (1/1) ... [2024-10-14 09:34:31,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:34:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:34:31,100 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-10-14 09:34:31,105 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-10-14 09:34:31,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:34:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:34:31,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:34:31,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:34:31,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:34:31,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:34:31,210 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:34:31,212 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:34:49,757 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 09:34:49,757 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:34:49,824 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:34:49,824 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:34:49,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:34:49 BoogieIcfgContainer [2024-10-14 09:34:49,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:34:49,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:34:49,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:34:49,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:34:49,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:34:30" (1/3) ... [2024-10-14 09:34:49,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5a949d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:34:49, skipping insertion in model container [2024-10-14 09:34:49,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:34:30" (2/3) ... [2024-10-14 09:34:49,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5a949d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:34:49, skipping insertion in model container [2024-10-14 09:34:49,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:34:49" (3/3) ... [2024-10-14 09:34:49,836 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-2.i [2024-10-14 09:34:49,850 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:34:49,850 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:34:49,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:34:49,916 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;@d1e08f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:34:49,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:34:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 46 states have (on average 1.565217391304348) internal successors, (72), 47 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 09:34:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 09:34:49,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:34:49,932 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:34:49,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:34:49,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:34:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1815284630, now seen corresponding path program 1 times [2024-10-14 09:34:49,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:34:49,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128939785] [2024-10-14 09:34:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:49,949 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-10-14 09:34:49,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:34:49,952 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-10-14 09:34:49,953 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-10-14 09:34:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:50,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:34:50,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:34:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-14 09:34:50,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:34:50,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:34:50,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128939785] [2024-10-14 09:34:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128939785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:34:50,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:34:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:34:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063786978] [2024-10-14 09:34:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:34:50,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:34:50,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:34:50,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:34:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:34:50,738 INFO L87 Difference]: Start difference. First operand has 68 states, 46 states have (on average 1.565217391304348) internal successors, (72), 47 states have internal predecessors, (72), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 09:34:54,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:34:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:34:54,983 INFO L93 Difference]: Finished difference Result 133 states and 237 transitions. [2024-10-14 09:34:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:34:55,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2024-10-14 09:34:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:34:55,061 INFO L225 Difference]: With dead ends: 133 [2024-10-14 09:34:55,061 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 09:34:55,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-10-14 09:34:55,067 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:34:55,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 09:34:55,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 09:34:55,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 09:34:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 09:34:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 101 transitions. [2024-10-14 09:34:55,101 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 101 transitions. Word has length 128 [2024-10-14 09:34:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:34:55,102 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 101 transitions. [2024-10-14 09:34:55,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 09:34:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 101 transitions. [2024-10-14 09:34:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 09:34:55,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:34:55,107 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:34:55,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:34:55,307 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-10-14 09:34:55,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:34:55,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:34:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1573490598, now seen corresponding path program 1 times [2024-10-14 09:34:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:34:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162509801] [2024-10-14 09:34:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:34:55,310 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-10-14 09:34:55,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:34:55,313 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-10-14 09:34:55,314 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-10-14 09:34:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:34:56,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:34:56,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:34:59,647 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 318 proven. 36 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-14 09:34:59,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:35:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-14 09:35:01,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:35:01,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162509801] [2024-10-14 09:35:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162509801] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:35:01,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:35:01,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 09:35:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656733519] [2024-10-14 09:35:01,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:35:01,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:35:01,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:35:01,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:35:01,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:35:01,746 INFO L87 Difference]: Start difference. First operand 66 states and 101 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-14 09:35:07,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 09:35:11,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 09:35:15,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 09:35:22,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 09:35:26,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 09:35:30,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-14 09:35:30,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:35:30,778 INFO L93 Difference]: Finished difference Result 137 states and 206 transitions. [2024-10-14 09:35:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:35:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 129 [2024-10-14 09:35:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:35:30,850 INFO L225 Difference]: With dead ends: 137 [2024-10-14 09:35:30,850 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 09:35:30,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:35:30,855 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 52 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2024-10-14 09:35:30,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 163 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 28.7s Time] [2024-10-14 09:35:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 09:35:30,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-10-14 09:35:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 09:35:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-10-14 09:35:30,867 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 129 [2024-10-14 09:35:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:35:30,869 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-10-14 09:35:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-14 09:35:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-10-14 09:35:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 09:35:30,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:35:30,871 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:35:30,901 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-10-14 09:35:31,071 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-10-14 09:35:31,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:35:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:35:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 716787077, now seen corresponding path program 1 times [2024-10-14 09:35:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:35:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41894965] [2024-10-14 09:35:31,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:35:31,073 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-10-14 09:35:31,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:35:31,075 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-10-14 09:35:31,077 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-10-14 09:35:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:35:31,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:35:31,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:35:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-10-14 09:35:33,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:35:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-14 09:35:35,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:35:35,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41894965] [2024-10-14 09:35:35,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41894965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:35:35,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:35:35,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-14 09:35:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341402080] [2024-10-14 09:35:35,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:35:35,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 09:35:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:35:35,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 09:35:35,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:35:35,989 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 09:35:45,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:35:49,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:35:53,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:35:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:35:53,958 INFO L93 Difference]: Finished difference Result 172 states and 242 transitions. [2024-10-14 09:35:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 09:35:53,962 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 131 [2024-10-14 09:35:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:35:53,964 INFO L225 Difference]: With dead ends: 172 [2024-10-14 09:35:53,964 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 09:35:53,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2024-10-14 09:35:53,966 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 140 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:35:53,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 231 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 341 Invalid, 3 Unknown, 0 Unchecked, 17.3s Time] [2024-10-14 09:35:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 09:35:53,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2024-10-14 09:35:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.203125) internal successors, (77), 65 states have internal predecessors, (77), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 09:35:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2024-10-14 09:35:53,992 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 131 [2024-10-14 09:35:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:35:53,992 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2024-10-14 09:35:53,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-14 09:35:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2024-10-14 09:35:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 09:35:53,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:35:53,994 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:35:54,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 09:35:54,199 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-10-14 09:35:54,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:35:54,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:35:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1449521748, now seen corresponding path program 1 times [2024-10-14 09:35:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:35:54,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317874987] [2024-10-14 09:35:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:35:54,201 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-10-14 09:35:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:35:54,204 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-10-14 09:35:54,207 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-10-14 09:35:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:35:55,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 09:35:55,340 INFO L278 TraceCheckSpWp]: Computing forward predicates...