./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_loopvsstraightlinecode_25-1loop_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:32:57,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:32:57,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:32:57,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:32:57,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:32:57,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:32:57,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:32:57,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:32:57,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:32:57,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:32:57,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:32:57,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:32:57,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:32:57,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:32:57,657 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:32:57,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:32:57,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:32:57,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:32:57,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:32:57,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:32:57,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:32:57,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:32:57,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:32:57,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:32:57,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:32:57,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:32:57,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:32:57,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:32:57,662 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:32:57,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:32:57,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:32:57,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:32:57,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:32:57,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:32:57,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:32:57,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:32:57,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:32:57,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:32:57,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:32:57,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:32:57,666 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:32:57,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:32:57,666 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-clean/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-clean/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 -> 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 [2024-10-11 11:32:57,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:32:57,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:32:57,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:32:57,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:32:57,955 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:32:57,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2024-10-11 11:32:59,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:32:59,715 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:32:59,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2024-10-11 11:32:59,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aafc2e6fc/e59bfcc1ec844645a9e3f2626334da74/FLAG4d057222f [2024-10-11 11:32:59,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aafc2e6fc/e59bfcc1ec844645a9e3f2626334da74 [2024-10-11 11:32:59,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:32:59,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:32:59,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:32:59,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:32:59,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:32:59,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:32:59" (1/1) ... [2024-10-11 11:32:59,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10295bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:59, skipping insertion in model container [2024-10-11 11:32:59,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:32:59" (1/1) ... [2024-10-11 11:32:59,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:32:59,945 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_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2024-10-11 11:32:59,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:33:00,001 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:33:00,018 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_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2024-10-11 11:33:00,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:33:00,060 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:33:00,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00 WrapperNode [2024-10-11 11:33:00,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:33:00,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:33:00,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:33:00,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:33:00,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,121 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-10-11 11:33:00,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:33:00,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:33:00,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:33:00,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:33:00,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,168 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-11 11:33:00,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:33:00,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:33:00,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:33:00,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:33:00,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (1/1) ... [2024-10-11 11:33:00,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:33:00,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:33:00,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:33:00,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:33:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:33:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:33:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:33:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:33:00,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:33:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:33:00,383 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:33:00,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:33:00,740 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 11:33:00,744 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:33:00,796 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:33:00,799 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:33:00,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:00 BoogieIcfgContainer [2024-10-11 11:33:00,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:33:00,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:33:00,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:33:00,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:33:00,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:32:59" (1/3) ... [2024-10-11 11:33:00,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd960f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:33:00, skipping insertion in model container [2024-10-11 11:33:00,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:00" (2/3) ... [2024-10-11 11:33:00,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd960f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:33:00, skipping insertion in model container [2024-10-11 11:33:00,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:00" (3/3) ... [2024-10-11 11:33:00,813 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i [2024-10-11 11:33:00,832 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:33:00,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:33:00,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:33:00,912 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;@24ab807a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:33:00,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:33:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 11:33:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 11:33:00,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:00,929 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:00,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:00,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1697868765, now seen corresponding path program 1 times [2024-10-11 11:33:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:00,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59458103] [2024-10-11 11:33:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:00,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:33:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:33:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:33:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:33:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:33:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:33:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:33:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 11:33:01,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59458103] [2024-10-11 11:33:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59458103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:01,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:01,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:33:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984740999] [2024-10-11 11:33:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:01,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:33:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:33:01,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:33:01,412 INFO L87 Difference]: Start difference. First operand has 56 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:33:01,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:01,467 INFO L93 Difference]: Finished difference Result 111 states and 186 transitions. [2024-10-11 11:33:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:33:01,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 105 [2024-10-11 11:33:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:01,483 INFO L225 Difference]: With dead ends: 111 [2024-10-11 11:33:01,483 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 11:33:01,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-11 11:33:01,493 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:01,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:33:01,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 11:33:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 11:33:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 11:33:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2024-10-11 11:33:01,552 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 105 [2024-10-11 11:33:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:01,554 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2024-10-11 11:33:01,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:33:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2024-10-11 11:33:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 11:33:01,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:01,559 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:01,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:33:01,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:01,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:01,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1918347041, now seen corresponding path program 1 times [2024-10-11 11:33:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626019378] [2024-10-11 11:33:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:33:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:33:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:33:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:33:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:33:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:33:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:33:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 11:33:02,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:02,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626019378] [2024-10-11 11:33:02,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626019378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:33:02,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696704720] [2024-10-11 11:33:02,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:02,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:33:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:02,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:33:02,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:33:02,377 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:33:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:02,789 INFO L93 Difference]: Finished difference Result 190 states and 283 transitions. [2024-10-11 11:33:02,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:33:02,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2024-10-11 11:33:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:02,795 INFO L225 Difference]: With dead ends: 190 [2024-10-11 11:33:02,796 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 11:33:02,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:33:02,798 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 117 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:02,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 336 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:33:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 11:33:02,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 63. [2024-10-11 11:33:02,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 11:33:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2024-10-11 11:33:02,827 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 105 [2024-10-11 11:33:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:02,830 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2024-10-11 11:33:02,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:33:02,831 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2024-10-11 11:33:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 11:33:02,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:02,833 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:02,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:33:02,835 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:02,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:02,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2047635297, now seen corresponding path program 1 times [2024-10-11 11:33:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:02,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307577065] [2024-10-11 11:33:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:33:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:33:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:33:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:33:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:33:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:33:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:33:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 11:33:03,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:03,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307577065] [2024-10-11 11:33:03,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307577065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:03,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:03,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:33:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988904983] [2024-10-11 11:33:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:03,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:33:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:03,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:33:03,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:33:03,254 INFO L87 Difference]: Start difference. First operand 63 states and 93 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:33:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:03,394 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2024-10-11 11:33:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:33:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2024-10-11 11:33:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:03,397 INFO L225 Difference]: With dead ends: 156 [2024-10-11 11:33:03,398 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 11:33:03,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:33:03,400 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 71 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:03,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 272 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:33:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 11:33:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2024-10-11 11:33:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 11:33:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2024-10-11 11:33:03,409 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 105 [2024-10-11 11:33:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:03,409 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2024-10-11 11:33:03,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:33:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2024-10-11 11:33:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 11:33:03,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:03,411 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:03,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:33:03,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:03,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:03,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1748950123, now seen corresponding path program 1 times [2024-10-11 11:33:03,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:03,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141793166] [2024-10-11 11:33:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:03,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:33:03,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:33:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:33:03,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:33:03,665 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:33:03,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:33:03,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:33:03,672 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 11:33:03,775 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:33:03,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:33:03 BoogieIcfgContainer [2024-10-11 11:33:03,782 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:33:03,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:33:03,783 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:33:03,783 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:33:03,784 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:00" (3/4) ... [2024-10-11 11:33:03,787 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:33:03,788 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:33:03,789 INFO L158 Benchmark]: Toolchain (without parser) took 4036.72ms. Allocated memory was 132.1MB in the beginning and 163.6MB in the end (delta: 31.5MB). Free memory was 79.1MB in the beginning and 52.6MB in the end (delta: 26.5MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-10-11 11:33:03,789 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 132.1MB. Free memory was 92.7MB in the beginning and 92.5MB in the end (delta: 142.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:33:03,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.31ms. Allocated memory is still 132.1MB. Free memory was 78.8MB in the beginning and 65.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:33:03,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.66ms. Allocated memory is still 132.1MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:33:03,794 INFO L158 Benchmark]: Boogie Preprocessor took 63.29ms. Allocated memory is still 132.1MB. Free memory was 62.9MB in the beginning and 103.9MB in the end (delta: -41.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-11 11:33:03,794 INFO L158 Benchmark]: RCFGBuilder took 613.93ms. Allocated memory was 132.1MB in the beginning and 163.6MB in the end (delta: 31.5MB). Free memory was 103.9MB in the beginning and 118.7MB in the end (delta: -14.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-10-11 11:33:03,794 INFO L158 Benchmark]: TraceAbstraction took 2977.54ms. Allocated memory is still 163.6MB. Free memory was 117.7MB in the beginning and 52.6MB in the end (delta: 65.0MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2024-10-11 11:33:03,794 INFO L158 Benchmark]: Witness Printer took 5.73ms. Allocated memory is still 163.6MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:33:03,796 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.19ms. Allocated memory is still 132.1MB. Free memory was 92.7MB in the beginning and 92.5MB in the end (delta: 142.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.31ms. Allocated memory is still 132.1MB. Free memory was 78.8MB in the beginning and 65.0MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.66ms. Allocated memory is still 132.1MB. Free memory was 65.0MB in the beginning and 62.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.29ms. Allocated memory is still 132.1MB. Free memory was 62.9MB in the beginning and 103.9MB in the end (delta: -41.1MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 613.93ms. Allocated memory was 132.1MB in the beginning and 163.6MB in the end (delta: 31.5MB). Free memory was 103.9MB in the beginning and 118.7MB in the end (delta: -14.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2977.54ms. Allocated memory is still 163.6MB. Free memory was 117.7MB in the beginning and 52.6MB in the end (delta: 65.0MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. * Witness Printer took 5.73ms. Allocated memory is still 163.6MB. Free memory is still 52.6MB. 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 someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] unsigned long int var_1_6 = 2; [L24] unsigned long int var_1_7 = 2762957886; [L25] unsigned long int var_1_8 = 2; [L26] unsigned long int var_1_9 = 1000000000; [L27] unsigned long int var_1_10 = 100; [L28] signed char var_1_11 = 4; [L29] signed char var_1_12 = 8; [L30] signed char var_1_13 = 10; [L31] signed char var_1_14 = 8; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 32.4; [L35] double var_1_18 = 15.5; [L36] unsigned long int last_1_var_1_6 = 2; [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_6 = var_1_6 [L105] RET updateLastVariables() [L106] CALL updateVariables() [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=2, var_1_9=1000000000] [L67] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=2, var_1_9=1000000000] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=2, var_1_9=1000000000] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=2, var_1_9=1000000000] [L69] var_1_8 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_9=1000000000] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_9=1000000000] [L71] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649, var_1_9=1000000000] [L71] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649, var_1_9=1000000000] [L72] var_1_9 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L74] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L74] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L75] var_1_10 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L76] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L77] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L77] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L78] var_1_12 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L80] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L80] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L81] var_1_13 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L83] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L83] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L84] var_1_14 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L86] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L86] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L88] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L89] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L89] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L90] var_1_18 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L91] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L106] RET updateVariables() [L107] CALL step() [L40] var_1_15 = var_1_16 [L41] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L42] COND TRUE \read(var_1_15) [L43] var_1_11 = (((var_1_12 + var_1_13) + var_1_14) - 50) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=25, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L45] COND TRUE \read(var_1_15) [L46] var_1_1 = (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L48] signed long int stepLocal_2 = (((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)); [L49] signed long int stepLocal_1 = (((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)); [L50] unsigned long int stepLocal_0 = var_1_7 - var_1_8; VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=2147483648, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=2, var_1_7=-1, var_1_8=-2147483649] [L51] COND FALSE !(last_1_var_1_6 != stepLocal_2) [L62] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=2147483648, stepLocal_1=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=-2147483649, var_1_7=-1, var_1_8=-2147483649] [L107] RET step() [L108] CALL, EXPR property() [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=-2147483649, var_1_7=-1, var_1_8=-2147483649] [L97] EXPR (last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=-2147483649, var_1_7=-1, var_1_8=-2147483649] [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=-2147483649, var_1_7=-1, var_1_8=-2147483649] [L97-L98] return ((((var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))) && (var_1_15 ? (var_1_11 == ((signed char) (((var_1_12 + var_1_13) + var_1_14) - 50))) : 1)) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((double) var_1_18)) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=-2147483649, var_1_7=-1, var_1_8=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=32, var_1_13=20, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967299, var_1_18=4294967299, var_1_1=2, var_1_6=-2147483649, var_1_7=-1, var_1_8=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 685 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 309 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 113 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1632/1632 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-11 11:33:03,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:33:06,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:33:06,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:33:06,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:33:06,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:33:06,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:33:06,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:33:06,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:33:06,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:33:06,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:33:06,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:33:06,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:33:06,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:33:06,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:33:06,314 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:33:06,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:33:06,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:33:06,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:33:06,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:33:06,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:33:06,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:33:06,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:33:06,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:33:06,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:33:06,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:33:06,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:33:06,318 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:33:06,318 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:33:06,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:33:06,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:33:06,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:33:06,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:33:06,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:33:06,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:33:06,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:33:06,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:33:06,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:33:06,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:33:06,330 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:33:06,330 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:33:06,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:33:06,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:33:06,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:33:06,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:33:06,333 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:33:06,334 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-clean/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-clean/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 -> 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 [2024-10-11 11:33:06,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:33:06,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:33:06,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:33:06,740 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:33:06,740 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:33:06,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2024-10-11 11:33:08,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:33:08,571 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:33:08,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2024-10-11 11:33:08,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/998085e0b/096711368e6841119a900dec5ddf8b15/FLAG75b4b7559 [2024-10-11 11:33:08,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/998085e0b/096711368e6841119a900dec5ddf8b15 [2024-10-11 11:33:08,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:33:08,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:33:08,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:33:08,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:33:08,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:33:08,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:33:08" (1/1) ... [2024-10-11 11:33:08,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7caceaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:08, skipping insertion in model container [2024-10-11 11:33:08,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:33:08" (1/1) ... [2024-10-11 11:33:08,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:33:08,873 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_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2024-10-11 11:33:08,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:33:08,966 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:33:08,980 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_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2024-10-11 11:33:09,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:33:09,037 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:33:09,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09 WrapperNode [2024-10-11 11:33:09,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:33:09,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:33:09,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:33:09,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:33:09,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,100 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-11 11:33:09,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:33:09,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:33:09,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:33:09,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:33:09,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,144 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-11 11:33:09,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:33:09,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:33:09,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:33:09,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:33:09,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:33:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:33:09,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:33:09,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:33:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:33:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:33:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:33:09,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:33:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:33:09,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:33:09,348 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:33:09,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:33:09,667 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 11:33:09,667 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:33:09,759 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:33:09,760 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:33:09,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:09 BoogieIcfgContainer [2024-10-11 11:33:09,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:33:09,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:33:09,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:33:09,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:33:09,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:33:08" (1/3) ... [2024-10-11 11:33:09,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5be0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:33:09, skipping insertion in model container [2024-10-11 11:33:09,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (2/3) ... [2024-10-11 11:33:09,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5be0da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:33:09, skipping insertion in model container [2024-10-11 11:33:09,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:09" (3/3) ... [2024-10-11 11:33:09,775 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i [2024-10-11 11:33:09,793 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:33:09,794 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:33:09,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:33:09,881 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;@2a769780, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:33:09,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:33:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 11:33:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 11:33:09,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:09,903 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:09,904 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:09,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:09,912 INFO L85 PathProgramCache]: Analyzing trace with hash -198418443, now seen corresponding path program 1 times [2024-10-11 11:33:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:33:09,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9634097] [2024-10-11 11:33:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:09,930 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-11 11:33:09,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:33:09,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 11:33:09,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:33:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:33:10,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:33:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2024-10-11 11:33:10,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:33:10,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:33:10,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9634097] [2024-10-11 11:33:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9634097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:10,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:10,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:33:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215645533] [2024-10-11 11:33:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:10,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:33:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:33:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:33:10,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:33:10,253 INFO L87 Difference]: Start difference. First operand has 45 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:33:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:10,308 INFO L93 Difference]: Finished difference Result 89 states and 154 transitions. [2024-10-11 11:33:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:33:10,311 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 103 [2024-10-11 11:33:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:10,319 INFO L225 Difference]: With dead ends: 89 [2024-10-11 11:33:10,320 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 11:33:10,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-11 11:33:10,329 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:10,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:33:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 11:33:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 11:33:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 11:33:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2024-10-11 11:33:10,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 103 [2024-10-11 11:33:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:10,387 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2024-10-11 11:33:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 11:33:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2024-10-11 11:33:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 11:33:10,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:10,396 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:10,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:33:10,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 11:33:10,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:10,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash 933012855, now seen corresponding path program 1 times [2024-10-11 11:33:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:33:10,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715210632] [2024-10-11 11:33:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:10,603 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-11 11:33:10,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:33:10,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 11:33:10,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:33:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 11:33:10,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:33:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 382 proven. 36 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-11 11:33:17,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:33:25,678 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 11:33:25,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:33:25,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715210632] [2024-10-11 11:33:25,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715210632] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 11:33:25,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:33:25,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [30] total 40 [2024-10-11 11:33:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742048291] [2024-10-11 11:33:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:25,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:33:25,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:33:25,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:33:25,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1281, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 11:33:25,684 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:33:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:27,832 INFO L93 Difference]: Finished difference Result 78 states and 110 transitions. [2024-10-11 11:33:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:33:27,834 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 103 [2024-10-11 11:33:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:27,837 INFO L225 Difference]: With dead ends: 78 [2024-10-11 11:33:27,837 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 11:33:27,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=332, Invalid=1560, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 11:33:27,840 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 81 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:27,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 193 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 11:33:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 11:33:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2024-10-11 11:33:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 38 states have internal predecessors, (45), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 11:33:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-10-11 11:33:27,867 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 103 [2024-10-11 11:33:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:27,868 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-10-11 11:33:27,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:33:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-10-11 11:33:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 11:33:27,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:27,870 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:27,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:33:28,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 11:33:28,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:28,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1586947079, now seen corresponding path program 1 times [2024-10-11 11:33:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:33:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332486753] [2024-10-11 11:33:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:28,076 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-11 11:33:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:33:28,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 11:33:28,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:33:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:28,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 11:33:28,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:33:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 11:33:28,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:33:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 11:33:28,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:33:28,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332486753] [2024-10-11 11:33:28,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332486753] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:33:28,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:33:28,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-10-11 11:33:28,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518153933] [2024-10-11 11:33:28,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:33:28,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:33:28,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:33:28,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:33:28,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:33:28,461 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 11:33:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:29,127 INFO L93 Difference]: Finished difference Result 162 states and 232 transitions. [2024-10-11 11:33:29,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 11:33:29,128 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 103 [2024-10-11 11:33:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:29,134 INFO L225 Difference]: With dead ends: 162 [2024-10-11 11:33:29,137 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 11:33:29,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2024-10-11 11:33:29,140 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 92 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:29,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 186 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:33:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 11:33:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2024-10-11 11:33:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 49 states have internal predecessors, (51), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 11:33:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-10-11 11:33:29,180 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 103 [2024-10-11 11:33:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:29,181 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-11 11:33:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 11:33:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-10-11 11:33:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 11:33:29,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:29,182 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:29,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:33:29,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 11:33:29,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:29,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:29,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1156444873, now seen corresponding path program 1 times [2024-10-11 11:33:29,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:33:29,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461917802] [2024-10-11 11:33:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:29,385 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-11 11:33:29,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:33:29,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 11:33:29,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 11:33:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:29,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 11:33:29,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:33:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 11:33:34,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:33:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 11:33:43,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:33:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461917802] [2024-10-11 11:33:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461917802] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 11:33:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:33:43,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 44 [2024-10-11 11:33:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015606575] [2024-10-11 11:33:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:33:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:33:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:33:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=1548, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 11:33:43,122 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:33:45,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:45,209 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2024-10-11 11:33:45,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 11:33:45,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2024-10-11 11:33:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:45,212 INFO L225 Difference]: With dead ends: 106 [2024-10-11 11:33:45,212 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 11:33:45,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=374, Invalid=1788, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 11:33:45,215 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 115 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:45,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 232 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 11:33:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 11:33:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 82. [2024-10-11 11:33:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:33:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2024-10-11 11:33:45,242 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 104 [2024-10-11 11:33:45,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:45,243 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2024-10-11 11:33:45,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:33:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2024-10-11 11:33:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 11:33:45,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:45,245 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:33:45,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 11:33:45,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 11:33:45,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:45,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1499673248, now seen corresponding path program 1 times [2024-10-11 11:33:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:33:45,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680101352] [2024-10-11 11:33:45,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:45,448 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-11 11:33:45,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:33:45,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 11:33:45,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 11:33:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:45,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 11:33:45,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:33:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 11:33:50,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:34:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 11:34:05,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:34:05,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680101352] [2024-10-11 11:34:05,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680101352] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 11:34:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:34:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [33] total 44 [2024-10-11 11:34:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892635241] [2024-10-11 11:34:05,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:34:05,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:34:05,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:34:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:34:05,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1536, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 11:34:05,149 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:34:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:34:09,117 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2024-10-11 11:34:09,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 11:34:09,119 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2024-10-11 11:34:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:34:09,121 INFO L225 Difference]: With dead ends: 91 [2024-10-11 11:34:09,121 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 11:34:09,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=366, Invalid=1614, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 11:34:09,123 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 98 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:34:09,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 167 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 11:34:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 11:34:09,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2024-10-11 11:34:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 46 states have internal predecessors, (49), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 11:34:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2024-10-11 11:34:09,161 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 105 [2024-10-11 11:34:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:34:09,164 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2024-10-11 11:34:09,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 11:34:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2024-10-11 11:34:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 11:34:09,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:34:09,165 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 11:34:09,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 11:34:09,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 11:34:09,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:34:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:34:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1499732830, now seen corresponding path program 1 times [2024-10-11 11:34:09,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:34:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068545966] [2024-10-11 11:34:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:34:09,368 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-11 11:34:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:34:09,369 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 11:34:09,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 11:34:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:09,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 11:34:09,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:34:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-11 11:34:14,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:34:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 11:34:23,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:34:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068545966] [2024-10-11 11:34:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068545966] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 11:34:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:34:23,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [35] total 47 [2024-10-11 11:34:23,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459502417] [2024-10-11 11:34:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:34:23,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:34:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:34:23,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:34:23,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=1804, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 11:34:23,142 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17)