./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a326c2fbbb6417ff70dc27510b2ae37e6b7c3658951387b9f90f15bb09c3ae0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:29:37,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:29:38,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:29:38,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:29:38,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:29:38,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:29:38,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:29:38,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:29:38,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:29:38,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:29:38,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:29:38,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:29:38,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:29:38,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:29:38,084 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:29:38,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:29:38,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:29:38,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:29:38,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:29:38,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:29:38,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:29:38,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:29:38,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:29:38,090 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:29:38,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:29:38,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:29:38,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:29:38,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:29:38,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:29:38,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:29:38,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:29:38,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:29:38,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:29:38,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:29:38,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:29:38,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:29:38,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:29:38,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:29:38,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:29:38,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:29:38,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:29:38,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:29:38,098 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a326c2fbbb6417ff70dc27510b2ae37e6b7c3658951387b9f90f15bb09c3ae0 [2024-11-10 07:29:38,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:29:38,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:29:38,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:29:38,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:29:38,383 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:29:38,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i [2024-11-10 07:29:39,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:29:40,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:29:40,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i [2024-11-10 07:29:40,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c77f0b7/b677de6f91bc44f4a891283bffc17467/FLAGdc84ce988 [2024-11-10 07:29:40,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9c77f0b7/b677de6f91bc44f4a891283bffc17467 [2024-11-10 07:29:40,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:29:40,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:29:40,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:29:40,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:29:40,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:29:40,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d0de8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40, skipping insertion in model container [2024-11-10 07:29:40,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:29:40,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i[915,928] [2024-11-10 07:29:40,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:29:40,684 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:29:40,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i[915,928] [2024-11-10 07:29:40,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:29:40,762 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:29:40,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40 WrapperNode [2024-11-10 07:29:40,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:29:40,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:29:40,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:29:40,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:29:40,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,821 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-10 07:29:40,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:29:40,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:29:40,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:29:40,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:29:40,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,866 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:29:40,867 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:29:40,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:29:40,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:29:40,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:29:40,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (1/1) ... [2024-11-10 07:29:40,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:29:40,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:29:40,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:29:40,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:29:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:29:41,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:29:41,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:29:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:29:41,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:29:41,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:29:41,112 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:29:41,114 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:29:41,407 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 07:29:41,408 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:29:41,424 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:29:41,424 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:29:41,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:41 BoogieIcfgContainer [2024-11-10 07:29:41,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:29:41,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:29:41,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:29:41,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:29:41,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:29:40" (1/3) ... [2024-11-10 07:29:41,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1343c901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:29:41, skipping insertion in model container [2024-11-10 07:29:41,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:40" (2/3) ... [2024-11-10 07:29:41,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1343c901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:29:41, skipping insertion in model container [2024-11-10 07:29:41,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:41" (3/3) ... [2024-11-10 07:29:41,432 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-83.i [2024-11-10 07:29:41,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:29:41,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:29:41,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:29:41,551 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;@11c35263, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:29:41,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:29:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 07:29:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 07:29:41,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:41,569 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:29:41,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:41,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:41,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1721000097, now seen corresponding path program 1 times [2024-11-10 07:29:41,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:29:41,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998241232] [2024-11-10 07:29:41,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:41,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:29:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:29:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:29:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:29:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:29:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:29:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:29:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:29:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:29:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:29:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:29:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:29:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:29:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:29:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:41,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:29:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:29:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 07:29:42,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:29:42,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998241232] [2024-11-10 07:29:42,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998241232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:29:42,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:29:42,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:29:42,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272846730] [2024-11-10 07:29:42,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:29:42,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:29:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:29:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:29:42,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:29:42,062 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 07:29:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:29:42,093 INFO L93 Difference]: Finished difference Result 92 states and 147 transitions. [2024-11-10 07:29:42,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:29:42,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-11-10 07:29:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:29:42,104 INFO L225 Difference]: With dead ends: 92 [2024-11-10 07:29:42,105 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 07:29:42,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:29:42,114 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:29:42,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:29:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 07:29:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-10 07:29:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 07:29:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-10 07:29:42,173 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 96 [2024-11-10 07:29:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:29:42,174 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-10 07:29:42,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 07:29:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-10 07:29:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 07:29:42,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:42,182 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:29:42,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:29:42,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:42,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash 373621500, now seen corresponding path program 1 times [2024-11-10 07:29:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:29:42,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857379411] [2024-11-10 07:29:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:42,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:29:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:29:42,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448899552] [2024-11-10 07:29:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:42,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:29:42,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:29:42,353 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:29:42,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:29:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:29:42,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:29:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:29:42,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:29:42,593 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:29:42,595 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:29:42,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:29:42,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:29:42,801 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 07:29:42,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:29:42,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:29:42 BoogieIcfgContainer [2024-11-10 07:29:42,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:29:42,879 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:29:42,879 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:29:42,879 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:29:42,880 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:41" (3/4) ... [2024-11-10 07:29:42,882 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:29:42,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:29:42,884 INFO L158 Benchmark]: Toolchain (without parser) took 2469.06ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 117.2MB in the beginning and 157.2MB in the end (delta: -40.0MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2024-11-10 07:29:42,887 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:29:42,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.11ms. Allocated memory is still 176.2MB. Free memory was 117.2MB in the beginning and 101.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:29:42,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.40ms. Allocated memory is still 176.2MB. Free memory was 101.5MB in the beginning and 98.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:29:42,889 INFO L158 Benchmark]: Boogie Preprocessor took 60.40ms. Allocated memory is still 176.2MB. Free memory was 98.3MB in the beginning and 93.4MB in the end (delta: 4.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:29:42,889 INFO L158 Benchmark]: IcfgBuilder took 541.38ms. Allocated memory is still 176.2MB. Free memory was 93.4MB in the beginning and 75.3MB in the end (delta: 18.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 07:29:42,889 INFO L158 Benchmark]: TraceAbstraction took 1451.08ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 74.3MB in the beginning and 157.2MB in the end (delta: -82.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:29:42,890 INFO L158 Benchmark]: Witness Printer took 4.99ms. Allocated memory is still 247.5MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:29:42,892 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.22ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.11ms. Allocated memory is still 176.2MB. Free memory was 117.2MB in the beginning and 101.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.40ms. Allocated memory is still 176.2MB. Free memory was 101.5MB in the beginning and 98.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.40ms. Allocated memory is still 176.2MB. Free memory was 98.3MB in the beginning and 93.4MB in the end (delta: 4.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 541.38ms. Allocated memory is still 176.2MB. Free memory was 93.4MB in the beginning and 75.3MB in the end (delta: 18.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1451.08ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 74.3MB in the beginning and 157.2MB in the end (delta: -82.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.99ms. Allocated memory is still 247.5MB. Free memory is still 157.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 49.8; [L27] double var_1_9 = 127.8; [L28] double var_1_10 = 7.2; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 2; [L31] signed char var_1_13 = 4; [L32] signed char var_1_14 = 16; [L33] unsigned short int var_1_15 = 0; VAL [isInitial=0, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L87] isInitial = 1 [L88] FCALL initially() [L89] int k_loop; [L90] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L90] COND TRUE k_loop < 1 [L91] FCALL updateLastVariables() [L92] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L59] var_1_3 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_8=249/5, var_1_9=639/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_8=249/5, var_1_9=639/5] [L64] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_8=249/5, var_1_9=639/5] [L64] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_8=249/5, var_1_9=639/5] [L65] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5, var_1_9=639/5] [L65] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5, var_1_9=639/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L70] var_1_12 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L72] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L72] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L73] var_1_13 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L75] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L75] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L76] var_1_14 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L78] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L78] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L92] RET updateVariables() [L93] CALL step() [L37] var_1_11 = ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14)))) [L38] var_1_15 = var_1_14 [L39] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=0, var_1_2=1, var_1_3=-65536, var_1_4=1, var_1_8=249/5] [L49] COND TRUE var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11)) [L50] var_1_8 = (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=0, var_1_2=1, var_1_3=-65536, var_1_4=1] [L93] RET step() [L94] CALL, EXPR property() [L83-L84] return (((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((var_1_15 * var_1_15)) < (var_1_11)) ? ((var_1_15 * var_1_15)) : (var_1_11)))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) 5)))) && ((var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11))) ? (var_1_8 == ((double) (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))) : (var_1_8 == ((double) var_1_9)))) && (var_1_11 == ((signed char) ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14))))))) && (var_1_15 == ((unsigned short int) var_1_14)) ; VAL [\result=0, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=0, var_1_2=1, var_1_3=-65536, var_1_4=1] [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=0, var_1_2=1, var_1_3=-65536, var_1_4=1] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=0, var_1_2=1, var_1_3=-65536, var_1_4=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 64 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 95 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:29:42,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a326c2fbbb6417ff70dc27510b2ae37e6b7c3658951387b9f90f15bb09c3ae0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:29:45,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:29:45,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:29:45,374 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:29:45,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:29:45,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:29:45,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:29:45,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:29:45,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:29:45,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:29:45,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:29:45,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:29:45,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:29:45,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:29:45,411 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:29:45,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:29:45,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:29:45,412 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:29:45,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:29:45,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:29:45,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:29:45,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:29:45,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:29:45,413 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:29:45,413 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:29:45,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:29:45,414 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:29:45,414 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:29:45,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:29:45,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:29:45,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:29:45,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:29:45,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:29:45,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:29:45,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:29:45,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:29:45,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:29:45,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:29:45,418 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:29:45,418 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:29:45,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:29:45,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:29:45,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:29:45,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:29:45,419 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a326c2fbbb6417ff70dc27510b2ae37e6b7c3658951387b9f90f15bb09c3ae0 [2024-11-10 07:29:45,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:29:45,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:29:45,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:29:45,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:29:45,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:29:45,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i [2024-11-10 07:29:47,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:29:47,622 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:29:47,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i [2024-11-10 07:29:47,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab53e1fb/383c16b2c553453c8b73be1395bc5bbe/FLAG10edfbfde [2024-11-10 07:29:47,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab53e1fb/383c16b2c553453c8b73be1395bc5bbe [2024-11-10 07:29:47,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:29:47,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:29:47,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:29:47,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:29:47,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:29:47,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:29:47" (1/1) ... [2024-11-10 07:29:47,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f6010ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:47, skipping insertion in model container [2024-11-10 07:29:47,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:29:47" (1/1) ... [2024-11-10 07:29:47,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:29:47,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i[915,928] [2024-11-10 07:29:47,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:29:47,977 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:29:47,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-83.i[915,928] [2024-11-10 07:29:48,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:29:48,049 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:29:48,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48 WrapperNode [2024-11-10 07:29:48,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:29:48,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:29:48,051 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:29:48,051 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:29:48,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,115 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-10 07:29:48,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:29:48,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:29:48,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:29:48,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:29:48,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,156 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:29:48,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,157 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:29:48,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:29:48,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:29:48,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:29:48,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (1/1) ... [2024-11-10 07:29:48,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:29:48,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:29:48,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:29:48,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:29:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:29:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:29:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:29:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:29:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:29:48,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:29:48,376 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:29:48,381 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:29:49,277 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-10 07:29:49,280 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:29:49,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:29:49,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:29:49,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:49 BoogieIcfgContainer [2024-11-10 07:29:49,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:29:49,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:29:49,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:29:49,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:29:49,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:29:47" (1/3) ... [2024-11-10 07:29:49,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5c3463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:29:49, skipping insertion in model container [2024-11-10 07:29:49,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:29:48" (2/3) ... [2024-11-10 07:29:49,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5c3463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:29:49, skipping insertion in model container [2024-11-10 07:29:49,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:29:49" (3/3) ... [2024-11-10 07:29:49,316 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-83.i [2024-11-10 07:29:49,335 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:29:49,336 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:29:49,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:29:49,425 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;@62eee232, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:29:49,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:29:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 07:29:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 07:29:49,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:49,444 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:29:49,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:49,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1721000097, now seen corresponding path program 1 times [2024-11-10 07:29:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:29:49,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877374582] [2024-11-10 07:29:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:49,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:29:49,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:29:49,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:29:49,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:29:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:49,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:29:49,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:29:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-10 07:29:49,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:29:49,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:29:49,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877374582] [2024-11-10 07:29:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877374582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:29:49,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:29:49,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:29:49,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287103336] [2024-11-10 07:29:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:29:49,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:29:49,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:29:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:29:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:29:49,847 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 07:29:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:29:49,873 INFO L93 Difference]: Finished difference Result 92 states and 147 transitions. [2024-11-10 07:29:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:29:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 96 [2024-11-10 07:29:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:29:49,881 INFO L225 Difference]: With dead ends: 92 [2024-11-10 07:29:49,881 INFO L226 Difference]: Without dead ends: 43 [2024-11-10 07:29:49,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:29:49,889 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:29:49,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:29:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-10 07:29:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-10 07:29:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 07:29:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-10 07:29:49,933 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 96 [2024-11-10 07:29:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:29:49,934 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-10 07:29:49,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 07:29:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-10 07:29:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 07:29:49,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:29:49,938 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:29:49,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:29:50,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:29:50,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:29:50,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:29:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash 373621500, now seen corresponding path program 1 times [2024-11-10 07:29:50,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:29:50,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782212405] [2024-11-10 07:29:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:29:50,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:29:50,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:29:50,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:29:50,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:29:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:29:50,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 07:29:50,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:30:24,770 WARN L286 SmtUtils]: Spent 15.53s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)