./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.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_codestructure_dependencies_file-26.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 fba2d2fd9748e406b77b0071a6b8fba8b1511c89c89792b5b77c2f3a558c57fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:07:11,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:07:11,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:07:11,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:07:11,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:07:11,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:07:11,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:07:11,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:07:11,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:07:11,554 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:07:11,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:07:11,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:07:11,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:07:11,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:07:11,556 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:07:11,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:07:11,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:07:11,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:07:11,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:07:11,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:07:11,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:07:11,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:07:11,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:07:11,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:07:11,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:07:11,569 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:07:11,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:07:11,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:07:11,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:07:11,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:07:11,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:07:11,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:07:11,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:07:11,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:07:11,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:07:11,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:07:11,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:07:11,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:07:11,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:07:11,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:07:11,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:07:11,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:07:11,575 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 -> fba2d2fd9748e406b77b0071a6b8fba8b1511c89c89792b5b77c2f3a558c57fc [2024-11-10 03:07:11,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:07:11,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:07:11,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:07:11,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:07:11,883 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:07:11,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.i [2024-11-10 03:07:13,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:07:13,532 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:07:13,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.i [2024-11-10 03:07:13,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e32265f/b6ccf9fd30ed4225913f5b3aeba0fe28/FLAGbe2ed452a [2024-11-10 03:07:13,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e32265f/b6ccf9fd30ed4225913f5b3aeba0fe28 [2024-11-10 03:07:13,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:07:13,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:07:13,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:07:13,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:07:13,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:07:13,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:07:13" (1/1) ... [2024-11-10 03:07:13,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263667ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:13, skipping insertion in model container [2024-11-10 03:07:13,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:07:13" (1/1) ... [2024-11-10 03:07:13,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:07:14,130 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.i[919,932] [2024-11-10 03:07:14,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:07:14,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:07:14,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.i[919,932] [2024-11-10 03:07:14,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:07:14,318 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:07:14,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14 WrapperNode [2024-11-10 03:07:14,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:07:14,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:07:14,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:07:14,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:07:14,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,377 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-10 03:07:14,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:07:14,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:07:14,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:07:14,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:07:14,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,420 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 03:07:14,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,432 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:07:14,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:07:14,451 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:07:14,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:07:14,453 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (1/1) ... [2024-11-10 03:07:14,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:07:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:07:14,488 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 03:07:14,490 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 03:07:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:07:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:07:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:07:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:07:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:07:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:07:14,645 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:07:14,647 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:07:14,948 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:07:14,948 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:07:14,967 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:07:14,967 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:07:14,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:14 BoogieIcfgContainer [2024-11-10 03:07:14,968 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:07:14,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:07:14,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:07:14,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:07:14,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:07:13" (1/3) ... [2024-11-10 03:07:14,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bdae02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:07:14, skipping insertion in model container [2024-11-10 03:07:14,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:14" (2/3) ... [2024-11-10 03:07:14,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bdae02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:07:14, skipping insertion in model container [2024-11-10 03:07:14,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:14" (3/3) ... [2024-11-10 03:07:14,976 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-26.i [2024-11-10 03:07:14,993 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:07:14,993 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:07:15,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:07:15,071 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;@1f1dde25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:07:15,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:07:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 03:07:15,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:07:15,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:07:15,093 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:07:15,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:07:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:07:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1873657821, now seen corresponding path program 1 times [2024-11-10 03:07:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:07:15,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195767979] [2024-11-10 03:07:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:07:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:07:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:07:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:07:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:07:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:07:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:07:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:07:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:07:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:07:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:07:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:07:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:07:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:07:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:07:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:07:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:07:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:07:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:07:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:07:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:07:15,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:07:15,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195767979] [2024-11-10 03:07:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195767979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:07:15,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:07:15,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:07:15,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562727490] [2024-11-10 03:07:15,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:07:15,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:07:15,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:07:15,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:07:15,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:07:15,566 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:07:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:07:15,588 INFO L93 Difference]: Finished difference Result 112 states and 191 transitions. [2024-11-10 03:07:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:07:15,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2024-11-10 03:07:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:07:15,601 INFO L225 Difference]: With dead ends: 112 [2024-11-10 03:07:15,601 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 03:07:15,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 03:07:15,607 INFO L432 NwaCegarLoop]: 82 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, 82 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 03:07:15,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:07:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 03:07:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 03:07:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 03:07:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-11-10 03:07:15,658 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 117 [2024-11-10 03:07:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:07:15,659 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-11-10 03:07:15,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:07:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-11-10 03:07:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:07:15,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:07:15,663 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:07:15,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:07:15,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:07:15,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:07:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash 970589285, now seen corresponding path program 1 times [2024-11-10 03:07:15,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:07:15,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263406935] [2024-11-10 03:07:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:07:15,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:07:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:07:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:07:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:07:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:07:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:07:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:07:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:07:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:07:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:07:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:07:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:07:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:07:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:07:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:15,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:07:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:07:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:07:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:07:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:07:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:07:16,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:07:16,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263406935] [2024-11-10 03:07:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263406935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:07:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:07:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:07:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2465101] [2024-11-10 03:07:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:07:16,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:07:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:07:16,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:07:16,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:07:16,043 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:07:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:07:16,102 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2024-11-10 03:07:16,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:07:16,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-10 03:07:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:07:16,110 INFO L225 Difference]: With dead ends: 133 [2024-11-10 03:07:16,110 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 03:07:16,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:07:16,114 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 33 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:07:16,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:07:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 03:07:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-10 03:07:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 03:07:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-11-10 03:07:16,138 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 117 [2024-11-10 03:07:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:07:16,139 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-11-10 03:07:16,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:07:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-11-10 03:07:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:07:16,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:07:16,142 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:07:16,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:07:16,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:07:16,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:07:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1896266148, now seen corresponding path program 1 times [2024-11-10 03:07:16,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:07:16,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497129065] [2024-11-10 03:07:16,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:07:16,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:07:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:07:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:07:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 03:07:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:07:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 03:07:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:07:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:07:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:07:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:07:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:07:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:07:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:07:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:07:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:07:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:07:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:07:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:07:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:07:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:07:16,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:07:16,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497129065] [2024-11-10 03:07:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497129065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:07:16,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:07:16,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:07:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532153617] [2024-11-10 03:07:16,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:07:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:07:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:07:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:07:16,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:07:16,650 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:07:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:07:16,845 INFO L93 Difference]: Finished difference Result 229 states and 341 transitions. [2024-11-10 03:07:16,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:07:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-10 03:07:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:07:16,851 INFO L225 Difference]: With dead ends: 229 [2024-11-10 03:07:16,851 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 03:07:16,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:07:16,854 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 70 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:07:16,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 227 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:07:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 03:07:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2024-11-10 03:07:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 89 states have internal predecessors, (120), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 03:07:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-11-10 03:07:16,897 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 118 [2024-11-10 03:07:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:07:16,899 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-11-10 03:07:16,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:07:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-11-10 03:07:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:07:16,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:07:16,905 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:07:16,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:07:16,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:07:16,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:07:16,906 INFO L85 PathProgramCache]: Analyzing trace with hash 88811685, now seen corresponding path program 1 times [2024-11-10 03:07:16,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:07:16,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327897233] [2024-11-10 03:07:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:07:16,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:07:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:07:17,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455303257] [2024-11-10 03:07:17,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:07:17,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:07:17,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:07:17,101 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 03:07:17,106 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 03:07:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:07:17,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:07:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:07:17,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:07:17,589 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:07:17,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:07:17,603 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 03:07:17,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:07:17,801 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:07:17,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:07:17,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:07:17 BoogieIcfgContainer [2024-11-10 03:07:17,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:07:17,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:07:17,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:07:17,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:07:17,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:14" (3/4) ... [2024-11-10 03:07:17,917 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:07:17,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:07:17,920 INFO L158 Benchmark]: Toolchain (without parser) took 4032.75ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 82.1MB in the beginning and 92.1MB in the end (delta: -10.1MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-11-10 03:07:17,923 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:07:17,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.97ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 122.8MB in the end (delta: -40.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-10 03:07:17,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.16ms. Allocated memory is still 159.4MB. Free memory was 122.8MB in the beginning and 119.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:07:17,924 INFO L158 Benchmark]: Boogie Preprocessor took 72.03ms. Allocated memory is still 159.4MB. Free memory was 119.4MB in the beginning and 114.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:07:17,924 INFO L158 Benchmark]: IcfgBuilder took 516.86ms. Allocated memory is still 159.4MB. Free memory was 114.3MB in the beginning and 112.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 03:07:17,925 INFO L158 Benchmark]: TraceAbstraction took 2943.17ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 111.6MB in the beginning and 92.1MB in the end (delta: 19.5MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2024-11-10 03:07:17,925 INFO L158 Benchmark]: Witness Printer took 4.64ms. Allocated memory is still 192.9MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:07:17,927 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.24ms. Allocated memory is still 159.4MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.97ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 122.8MB in the end (delta: -40.9MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.16ms. Allocated memory is still 159.4MB. Free memory was 122.8MB in the beginning and 119.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.03ms. Allocated memory is still 159.4MB. Free memory was 119.4MB in the beginning and 114.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 516.86ms. Allocated memory is still 159.4MB. Free memory was 114.3MB in the beginning and 112.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2943.17ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 111.6MB in the beginning and 92.1MB in the end (delta: 19.5MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * Witness Printer took 4.64ms. Allocated memory is still 192.9MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned long int last_1_var_1_1 = 16; [L39] signed char last_1_var_1_9 = 10; [L40] unsigned short int last_1_var_1_12 = 10000; [L41] double last_1_var_1_20 = 1.5; [L42] unsigned char last_1_var_1_22 = 5; [L43] signed short int last_1_var_1_25 = 10; VAL [isInitial=0, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=-64, var_1_9=10] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L119] last_1_var_1_1 = var_1_1 [L120] last_1_var_1_9 = var_1_9 [L121] last_1_var_1_12 = var_1_12 [L122] last_1_var_1_20 = var_1_20 [L123] last_1_var_1_22 = var_1_22 [L124] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=-64, var_1_9=10] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L89] var_1_4 = __VERIFIER_nondet_long() [L90] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L90] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L91] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L91] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L92] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L93] var_1_10 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L95] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L96] var_1_11 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L97] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L98] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L99] var_1_13 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L100] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L101] var_1_14 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L102] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L103] var_1_18 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L104] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L105] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L105] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L107] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L108] var_1_23 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L109] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L110] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L110] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L111] var_1_24 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L112] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L113] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L113] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_26=321/5, var_1_4=4, var_1_9=10] [L114] var_1_26 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L115] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L116] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L116] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=10] [L135] RET updateVariables() [L136] CALL step() [L47] COND FALSE !(! var_1_10) [L54] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=8] [L56] COND FALSE !(last_1_var_1_1 > last_1_var_1_12) [L67] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=8] [L69] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=8] [L70] COND FALSE !(last_1_var_1_22 >= last_1_var_1_12) [L73] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=8] [L76] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L77] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=10, var_1_4=4, var_1_9=8] [L79] COND TRUE (var_1_20 / var_1_26) > var_1_13 [L80] var_1_25 = ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=8] [L84] COND TRUE ((var_1_25 + var_1_9) / var_1_4) == var_1_25 [L85] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=8] [L136] RET step() [L137] CALL, EXPR property() [L127-L128] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=8] [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=8, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_22=257, var_1_23=32767, var_1_24=257, var_1_25=2, var_1_4=4, var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 476 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 259 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 588 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1836/1836 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 03:07:17,959 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_codestructure_dependencies_file-26.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 fba2d2fd9748e406b77b0071a6b8fba8b1511c89c89792b5b77c2f3a558c57fc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:07:20,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:07:20,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:07:20,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:07:20,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:07:20,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:07:20,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:07:20,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:07:20,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:07:20,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:07:20,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:07:20,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:07:20,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:07:20,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:07:20,381 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:07:20,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:07:20,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:07:20,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:07:20,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:07:20,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:07:20,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:07:20,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:07:20,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:07:20,386 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:07:20,386 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:07:20,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:07:20,386 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:07:20,396 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:07:20,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:07:20,396 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:07:20,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:07:20,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:07:20,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:07:20,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:07:20,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:07:20,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:07:20,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:07:20,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:07:20,398 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:07:20,399 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:07:20,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:07:20,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:07:20,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:07:20,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:07:20,402 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 -> fba2d2fd9748e406b77b0071a6b8fba8b1511c89c89792b5b77c2f3a558c57fc [2024-11-10 03:07:20,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:07:20,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:07:20,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:07:20,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:07:20,772 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:07:20,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.i [2024-11-10 03:07:22,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:07:22,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:07:22,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.i [2024-11-10 03:07:22,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f2a2c49/84b8f67decbe4a70b0897e978ca5bc52/FLAGaccbacec6 [2024-11-10 03:07:22,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f2a2c49/84b8f67decbe4a70b0897e978ca5bc52 [2024-11-10 03:07:22,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:07:22,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:07:22,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:07:22,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:07:23,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:07:23,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:07:22" (1/1) ... [2024-11-10 03:07:23,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688c7690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23, skipping insertion in model container [2024-11-10 03:07:23,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:07:22" (1/1) ... [2024-11-10 03:07:23,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:07:23,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.i[919,932] [2024-11-10 03:07:23,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:07:23,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:07:23,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-26.i[919,932] [2024-11-10 03:07:23,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:07:23,386 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:07:23,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23 WrapperNode [2024-11-10 03:07:23,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:07:23,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:07:23,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:07:23,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:07:23,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,442 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-10 03:07:23,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:07:23,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:07:23,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:07:23,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:07:23,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,490 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 03:07:23,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,513 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:07:23,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:07:23,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:07:23,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:07:23,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (1/1) ... [2024-11-10 03:07:23,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:07:23,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:07:23,577 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 03:07:23,584 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 03:07:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:07:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:07:23,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:07:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:07:23,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:07:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:07:23,704 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:07:23,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:07:37,502 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:07:37,502 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:07:37,514 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:07:37,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:07:37,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:37 BoogieIcfgContainer [2024-11-10 03:07:37,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:07:37,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:07:37,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:07:37,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:07:37,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:07:22" (1/3) ... [2024-11-10 03:07:37,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11214519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:07:37, skipping insertion in model container [2024-11-10 03:07:37,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:07:23" (2/3) ... [2024-11-10 03:07:37,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11214519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:07:37, skipping insertion in model container [2024-11-10 03:07:37,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:07:37" (3/3) ... [2024-11-10 03:07:37,526 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-26.i [2024-11-10 03:07:37,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:07:37,546 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:07:37,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:07:37,617 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;@64c2769c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:07:37,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:07:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 03:07:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:07:37,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:07:37,637 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:07:37,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:07:37,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:07:37,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1873657821, now seen corresponding path program 1 times [2024-11-10 03:07:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:07:37,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280378400] [2024-11-10 03:07:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:07:37,663 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 03:07:37,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:07:37,666 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 03:07:37,668 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 03:07:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:38,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:07:38,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:07:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-10 03:07:38,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:07:38,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:07:38,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280378400] [2024-11-10 03:07:38,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280378400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:07:38,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:07:38,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:07:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31264839] [2024-11-10 03:07:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:07:38,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:07:38,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:07:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:07:38,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:07:38,624 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:07:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:07:38,650 INFO L93 Difference]: Finished difference Result 112 states and 191 transitions. [2024-11-10 03:07:38,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:07:38,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2024-11-10 03:07:38,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:07:38,659 INFO L225 Difference]: With dead ends: 112 [2024-11-10 03:07:38,659 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 03:07:38,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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 03:07:38,667 INFO L432 NwaCegarLoop]: 82 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, 82 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 03:07:38,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:07:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 03:07:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 03:07:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 03:07:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-11-10 03:07:38,710 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 117 [2024-11-10 03:07:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:07:38,710 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-11-10 03:07:38,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 03:07:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-11-10 03:07:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 03:07:38,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:07:38,715 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:07:38,738 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 03:07:38,916 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 03:07:38,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:07:38,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:07:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash 970589285, now seen corresponding path program 1 times [2024-11-10 03:07:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:07:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850085114] [2024-11-10 03:07:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:07:38,919 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 03:07:38,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:07:38,923 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 03:07:38,924 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 03:07:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:39,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 03:07:39,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:07:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:07:39,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:07:39,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:07:39,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850085114] [2024-11-10 03:07:39,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850085114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:07:39,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:07:39,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:07:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351592254] [2024-11-10 03:07:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:07:39,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:07:39,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:07:39,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:07:39,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:07:39,909 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:07:44,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:07:48,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:07:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:07:48,791 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2024-11-10 03:07:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:07:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-10 03:07:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:07:48,794 INFO L225 Difference]: With dead ends: 133 [2024-11-10 03:07:48,794 INFO L226 Difference]: Without dead ends: 81 [2024-11-10 03:07:48,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:07:48,796 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:07:48,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 167 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-10 03:07:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-10 03:07:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2024-11-10 03:07:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 03:07:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-11-10 03:07:48,811 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 117 [2024-11-10 03:07:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:07:48,812 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-11-10 03:07:48,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:07:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-11-10 03:07:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:07:48,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:07:48,815 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:07:48,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:07:49,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:07:49,016 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:07:49,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:07:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1896266148, now seen corresponding path program 1 times [2024-11-10 03:07:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:07:49,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438362881] [2024-11-10 03:07:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:07:49,017 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 03:07:49,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:07:49,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:07:49,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:07:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:07:49,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 03:07:49,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:07:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 03:07:52,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:07:52,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:07:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438362881] [2024-11-10 03:07:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438362881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:07:52,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:07:52,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:07:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487452471] [2024-11-10 03:07:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:07:52,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:07:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:07:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:07:52,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:07:52,807 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:07:57,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:08:01,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:08:05,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:08:06,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:08:11,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:08:15,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:08:15,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:08:15,313 INFO L93 Difference]: Finished difference Result 229 states and 341 transitions. [2024-11-10 03:08:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:08:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-10 03:08:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:08:15,418 INFO L225 Difference]: With dead ends: 229 [2024-11-10 03:08:15,419 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 03:08:15,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:08:15,424 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 67 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 37 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:08:15,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 228 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 22.4s Time] [2024-11-10 03:08:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 03:08:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 131. [2024-11-10 03:08:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 89 states have internal predecessors, (120), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 03:08:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-11-10 03:08:15,464 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 118 [2024-11-10 03:08:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:08:15,465 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-11-10 03:08:15,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 03:08:15,465 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-11-10 03:08:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:08:15,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:08:15,474 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:08:15,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 03:08:15,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:08:15,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:08:15,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:08:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash 88811685, now seen corresponding path program 1 times [2024-11-10 03:08:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:08:15,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392005273] [2024-11-10 03:08:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:08:15,676 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 03:08:15,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:08:15,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:08:15,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 03:08:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:08:16,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 03:08:16,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:08:44,668 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)