./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.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 cf8b375ecaf5e7f492500087304bb604d88ab477e5c68263b7ad030500238492 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:56:31,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:56:31,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:56:31,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:56:31,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:56:31,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:56:31,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:56:31,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:56:31,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:56:31,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:56:31,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:56:31,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:56:31,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:56:31,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:56:31,558 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:56:31,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:56:31,559 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:56:31,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:56:31,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:56:31,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:56:31,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:56:31,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:56:31,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:56:31,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:56:31,563 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:56:31,563 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:56:31,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:56:31,564 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:56:31,564 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:56:31,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:56:31,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:56:31,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:56:31,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:56:31,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:56:31,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:56:31,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:56:31,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:56:31,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:56:31,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:56:31,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:56:31,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:56:31,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:56:31,570 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 -> cf8b375ecaf5e7f492500087304bb604d88ab477e5c68263b7ad030500238492 [2024-11-08 23:56:31,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:56:31,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:56:31,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:56:31,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:56:31,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:56:31,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i [2024-11-08 23:56:33,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:56:33,581 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:56:33,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i [2024-11-08 23:56:33,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb07a743/e9ffad5efc9c4fab8e076952783730f6/FLAG8124497dc [2024-11-08 23:56:33,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eb07a743/e9ffad5efc9c4fab8e076952783730f6 [2024-11-08 23:56:33,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:56:33,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:56:33,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:56:33,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:56:33,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:56:33,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56be9673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33, skipping insertion in model container [2024-11-08 23:56:33,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:56:33,798 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i[914,927] [2024-11-08 23:56:33,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:56:33,841 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:56:33,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i[914,927] [2024-11-08 23:56:33,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:56:33,894 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:56:33,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33 WrapperNode [2024-11-08 23:56:33,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:56:33,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:56:33,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:56:33,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:56:33,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,945 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-08 23:56:33,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:56:33,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:56:33,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:56:33,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:56:33,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,983 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-08 23:56:33,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:33,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:34,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:34,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:34,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:56:34,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:56:34,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:56:34,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:56:34,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (1/1) ... [2024-11-08 23:56:34,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:56:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:56:34,059 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-08 23:56:34,064 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-08 23:56:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:56:34,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:56:34,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:56:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:56:34,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:56:34,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:56:34,205 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:56:34,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:56:34,510 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 23:56:34,510 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:56:34,523 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:56:34,523 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:56:34,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:56:34 BoogieIcfgContainer [2024-11-08 23:56:34,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:56:34,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:56:34,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:56:34,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:56:34,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:56:33" (1/3) ... [2024-11-08 23:56:34,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f2ff47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:56:34, skipping insertion in model container [2024-11-08 23:56:34,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:33" (2/3) ... [2024-11-08 23:56:34,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f2ff47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:56:34, skipping insertion in model container [2024-11-08 23:56:34,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:56:34" (3/3) ... [2024-11-08 23:56:34,534 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-8.i [2024-11-08 23:56:34,550 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:56:34,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:56:34,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:56:34,614 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;@149508d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:56:34,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:56:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:56:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:56:34,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:34,629 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:34,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:34,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1472964719, now seen corresponding path program 1 times [2024-11-08 23:56:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:56:34,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030458588] [2024-11-08 23:56:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:56:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:56:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:56:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:56:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:56:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:56:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:56:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:56:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:56:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:56:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:56:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:56:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:56:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:56:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:56:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:56:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:56:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:56:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:56:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:56:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:56:35,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:56:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030458588] [2024-11-08 23:56:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030458588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:56:35,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:56:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:56:35,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620411218] [2024-11-08 23:56:35,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:56:35,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:56:35,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:56:35,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:56:35,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:56:35,080 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:56:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:56:35,157 INFO L93 Difference]: Finished difference Result 103 states and 176 transitions. [2024-11-08 23:56:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:56:35,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-08 23:56:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:56:35,177 INFO L225 Difference]: With dead ends: 103 [2024-11-08 23:56:35,177 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 23:56:35,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:56:35,184 INFO L432 NwaCegarLoop]: 74 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, 74 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-08 23:56:35,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:56:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 23:56:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 23:56:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:56:35,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-08 23:56:35,228 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 125 [2024-11-08 23:56:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:56:35,229 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-08 23:56:35,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:56:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-08 23:56:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:56:35,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:35,232 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:35,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:56:35,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:35,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -286332501, now seen corresponding path program 1 times [2024-11-08 23:56:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:56:35,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598115934] [2024-11-08 23:56:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:56:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:56:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:56:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:56:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:56:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:56:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:56:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:56:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:56:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:56:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:56:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:56:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:56:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:56:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:56:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:56:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:56:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:56:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:56:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:56:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:56:35,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:56:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598115934] [2024-11-08 23:56:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598115934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:56:35,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:56:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:56:35,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009436240] [2024-11-08 23:56:35,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:56:35,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:56:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:56:35,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:56:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:56:35,727 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:56:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:56:35,871 INFO L93 Difference]: Finished difference Result 99 states and 145 transitions. [2024-11-08 23:56:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:56:35,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-08 23:56:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:56:35,874 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:56:35,874 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 23:56:35,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:56:35,876 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:56:35,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 69 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:56:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 23:56:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 23:56:35,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:56:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-08 23:56:35,893 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 125 [2024-11-08 23:56:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:56:35,896 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-08 23:56:35,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:56:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-08 23:56:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:56:35,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:35,898 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:35,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:56:35,899 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:35,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 393725869, now seen corresponding path program 1 times [2024-11-08 23:56:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:56:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888031333] [2024-11-08 23:56:35,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:35,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:56:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:56:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:56:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:56:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:56:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:56:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:56:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:56:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:56:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:56:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:56:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:56:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:56:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:56:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:56:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:56:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:56:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:56:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:56:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:56:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 23:56:36,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:56:36,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888031333] [2024-11-08 23:56:36,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888031333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:56:36,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989684287] [2024-11-08 23:56:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:36,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:56:36,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:56:36,285 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-08 23:56:36,287 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-08 23:56:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:36,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:56:36,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:56:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-08 23:56:36,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:56:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 23:56:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989684287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:56:36,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:56:36,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:56:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967441786] [2024-11-08 23:56:36,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:56:36,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:56:36,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:56:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:56:36,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:56:36,936 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 23:56:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:56:37,126 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-11-08 23:56:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:56:37,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 125 [2024-11-08 23:56:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:56:37,129 INFO L225 Difference]: With dead ends: 107 [2024-11-08 23:56:37,129 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 23:56:37,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:56:37,130 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:56:37,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:56:37,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 23:56:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-08 23:56:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:56:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-11-08 23:56:37,150 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 125 [2024-11-08 23:56:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:56:37,151 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-11-08 23:56:37,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 23:56:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-11-08 23:56:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:56:37,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:37,153 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:37,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:56:37,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:56:37,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:37,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 395572911, now seen corresponding path program 1 times [2024-11-08 23:56:37,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:56:37,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433923315] [2024-11-08 23:56:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:37,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:56:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:37,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:56:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:56:37,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:56:37,584 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:56:37,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:56:37,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:56:37,590 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 23:56:37,693 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:56:37,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:56:37 BoogieIcfgContainer [2024-11-08 23:56:37,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:56:37,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:56:37,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:56:37,701 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:56:37,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:56:34" (3/4) ... [2024-11-08 23:56:37,704 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:56:37,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:56:37,706 INFO L158 Benchmark]: Toolchain (without parser) took 4100.42ms. Allocated memory was 188.7MB in the beginning and 228.6MB in the end (delta: 39.8MB). Free memory was 159.2MB in the beginning and 152.9MB in the end (delta: 6.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-08 23:56:37,706 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:56:37,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.15ms. Allocated memory is still 188.7MB. Free memory was 159.0MB in the beginning and 148.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-08 23:56:37,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.37ms. Allocated memory is still 188.7MB. Free memory was 148.5MB in the beginning and 145.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:56:37,707 INFO L158 Benchmark]: Boogie Preprocessor took 62.36ms. Allocated memory is still 188.7MB. Free memory was 145.6MB in the beginning and 142.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:56:37,708 INFO L158 Benchmark]: RCFGBuilder took 511.80ms. Allocated memory is still 188.7MB. Free memory was 142.7MB in the beginning and 125.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:56:37,708 INFO L158 Benchmark]: TraceAbstraction took 3173.62ms. Allocated memory was 188.7MB in the beginning and 228.6MB in the end (delta: 39.8MB). Free memory was 125.9MB in the beginning and 153.9MB in the end (delta: -28.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-08 23:56:37,708 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 228.6MB. Free memory was 153.9MB in the beginning and 152.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:56:37,711 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.18ms. Allocated memory is still 130.0MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.15ms. Allocated memory is still 188.7MB. Free memory was 159.0MB in the beginning and 148.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.37ms. Allocated memory is still 188.7MB. Free memory was 148.5MB in the beginning and 145.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.36ms. Allocated memory is still 188.7MB. Free memory was 145.6MB in the beginning and 142.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.80ms. Allocated memory is still 188.7MB. Free memory was 142.7MB in the beginning and 125.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3173.62ms. Allocated memory was 188.7MB in the beginning and 228.6MB in the end (delta: 39.8MB). Free memory was 125.9MB in the beginning and 153.9MB in the end (delta: -28.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 228.6MB. Free memory was 153.9MB in the beginning and 152.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] signed char var_1_11 = 2; [L29] signed char var_1_12 = 32; [L30] signed char var_1_13 = 2; [L31] float var_1_14 = 31.325; [L32] float var_1_15 = 7.4; [L33] float var_1_16 = 7.375; [L34] unsigned short int var_1_17 = 256; [L35] unsigned short int var_1_19 = 24509; [L36] unsigned short int var_1_20 = 32; [L37] unsigned short int var_1_21 = 4; [L38] signed char last_1_var_1_11 = 2; VAL [isInitial=0, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L61] var_1_4 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L62] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L63] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L63] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L64] var_1_5 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L66] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L66] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L67] var_1_6 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_7 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L71] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L72] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=32, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L73] var_1_12 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L74] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L75] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=2, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L76] var_1_13 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L77] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L78] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_15=37/5, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L79] var_1_15 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L80] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_16=59/8, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L81] var_1_16 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L82] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=24509, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L83] var_1_19 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L84] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L85] CALL assume_abort_if_not(var_1_19 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L85] RET assume_abort_if_not(var_1_19 <= 32767) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=32, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L86] var_1_20 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L87] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L88] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=4, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L89] var_1_21 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L90] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L91] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L91] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L105] RET updateVariables() [L106] CALL step() [L42] COND FALSE !(((((16) < 0 ) ? -(16) : (16))) < last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_14=1253/40, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L45] var_1_14 = (var_1_15 - var_1_16) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=256, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L46] COND TRUE var_1_14 <= ((var_1_15 - var_1_16) * var_1_14) [L47] var_1_17 = ((var_1_19 - var_1_20) + var_1_21) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=0, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L51] COND FALSE !(var_1_17 >= (8u * var_1_17)) [L54] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L56] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L106] RET step() [L107] CALL, EXPR property() [L97-L98] return (((((var_1_17 >= (8u * var_1_17)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed long int) (var_1_17 + var_1_11))) : 1)) && ((((((16) < 0 ) ? -(16) : (16))) < last_1_var_1_11) ? (var_1_11 == ((signed char) (var_1_12 + var_1_13))) : 1)) && (var_1_14 == ((float) (var_1_15 - var_1_16)))) && ((var_1_14 <= ((var_1_15 - var_1_16) * var_1_14)) ? (var_1_17 == ((unsigned short int) ((var_1_19 - var_1_20) + var_1_21))) : (var_1_17 == ((unsigned short int) var_1_20))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=2, var_1_11=2, var_1_12=63, var_1_13=63, var_1_17=16383, var_1_19=-1073643522, var_1_1=-255, var_1_20=16383, var_1_21=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-255, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 119 IncrementalHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 190 mSDtfsCounter, 119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 404 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1366 SizeOfPredicates, 1 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3656/3800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:56:37,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.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 cf8b375ecaf5e7f492500087304bb604d88ab477e5c68263b7ad030500238492 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:56:39,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:56:39,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:56:39,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:56:39,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:56:39,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:56:39,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:56:39,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:56:39,984 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:56:39,984 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:56:39,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:56:39,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:56:39,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:56:39,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:56:39,987 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:56:39,988 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:56:39,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:56:39,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:56:39,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:56:39,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:56:39,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:56:39,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:56:39,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:56:39,994 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:56:39,994 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:56:39,994 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:56:39,995 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:56:39,995 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:56:39,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:56:39,995 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:56:39,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:56:39,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:56:39,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:56:39,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:56:39,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:56:39,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:56:39,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:56:39,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:56:39,997 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:56:39,999 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:56:39,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:56:40,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:56:40,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:56:40,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:56:40,001 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 -> cf8b375ecaf5e7f492500087304bb604d88ab477e5c68263b7ad030500238492 [2024-11-08 23:56:40,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:56:40,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:56:40,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:56:40,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:56:40,316 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:56:40,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i [2024-11-08 23:56:41,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:56:42,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:56:42,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i [2024-11-08 23:56:42,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819b8210d/21deefcc64ac4a6bbaa914e2ce58746f/FLAGe2226f318 [2024-11-08 23:56:42,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/819b8210d/21deefcc64ac4a6bbaa914e2ce58746f [2024-11-08 23:56:42,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:56:42,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:56:42,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:56:42,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:56:42,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:56:42,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5222defd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42, skipping insertion in model container [2024-11-08 23:56:42,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:56:42,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i[914,927] [2024-11-08 23:56:42,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:56:42,351 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:56:42,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-8.i[914,927] [2024-11-08 23:56:42,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:56:42,414 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:56:42,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42 WrapperNode [2024-11-08 23:56:42,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:56:42,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:56:42,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:56:42,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:56:42,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,468 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-08 23:56:42,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:56:42,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:56:42,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:56:42,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:56:42,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,512 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-08 23:56:42,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:56:42,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:56:42,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:56:42,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:56:42,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (1/1) ... [2024-11-08 23:56:42,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:56:42,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:56:42,576 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-08 23:56:42,579 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-08 23:56:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:56:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:56:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:56:42,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:56:42,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:56:42,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:56:42,731 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:56:42,733 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:56:44,085 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 23:56:44,086 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:56:44,102 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:56:44,102 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:56:44,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:56:44 BoogieIcfgContainer [2024-11-08 23:56:44,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:56:44,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:56:44,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:56:44,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:56:44,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:56:42" (1/3) ... [2024-11-08 23:56:44,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6aefe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:56:44, skipping insertion in model container [2024-11-08 23:56:44,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:56:42" (2/3) ... [2024-11-08 23:56:44,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6aefe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:56:44, skipping insertion in model container [2024-11-08 23:56:44,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:56:44" (3/3) ... [2024-11-08 23:56:44,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-8.i [2024-11-08 23:56:44,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:56:44,135 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:56:44,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:56:44,192 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;@3c5a1958, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:56:44,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:56:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:56:44,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:56:44,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:44,220 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:44,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:44,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:44,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1472964719, now seen corresponding path program 1 times [2024-11-08 23:56:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:56:44,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116602439] [2024-11-08 23:56:44,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:44,244 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-08 23:56:44,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:56:44,251 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-08 23:56:44,256 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-08 23:56:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:44,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:56:44,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:56:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-08 23:56:44,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:56:44,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:56:44,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116602439] [2024-11-08 23:56:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116602439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:56:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:56:44,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:56:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707740615] [2024-11-08 23:56:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:56:44,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:56:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:56:44,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:56:44,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:56:44,636 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:56:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:56:44,673 INFO L93 Difference]: Finished difference Result 103 states and 176 transitions. [2024-11-08 23:56:44,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:56:44,677 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-11-08 23:56:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:56:44,686 INFO L225 Difference]: With dead ends: 103 [2024-11-08 23:56:44,686 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 23:56:44,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-08 23:56:44,695 INFO L432 NwaCegarLoop]: 74 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, 74 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-08 23:56:44,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:56:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 23:56:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 23:56:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:56:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-08 23:56:44,752 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 125 [2024-11-08 23:56:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:56:44,752 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-08 23:56:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 23:56:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-08 23:56:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:56:44,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:44,760 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:44,772 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-08 23:56:44,961 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-08 23:56:44,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:44,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:44,962 INFO L85 PathProgramCache]: Analyzing trace with hash -286332501, now seen corresponding path program 1 times [2024-11-08 23:56:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:56:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100432740] [2024-11-08 23:56:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:44,963 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-08 23:56:44,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:56:44,967 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-08 23:56:44,968 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-08 23:56:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:45,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:56:45,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:56:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 23:56:45,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:56:45,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:56:45,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100432740] [2024-11-08 23:56:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100432740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:56:45,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:56:45,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:56:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747689923] [2024-11-08 23:56:45,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:56:45,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:56:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:56:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:56:45,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:56:45,625 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:56:46,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:56:46,143 INFO L93 Difference]: Finished difference Result 99 states and 145 transitions. [2024-11-08 23:56:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:56:46,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-11-08 23:56:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:56:46,157 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:56:46,157 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 23:56:46,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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-08 23:56:46,159 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:56:46,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:56:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 23:56:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 23:56:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:56:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-08 23:56:46,175 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 125 [2024-11-08 23:56:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:56:46,177 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-08 23:56:46,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 23:56:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-08 23:56:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:56:46,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:46,182 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:46,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:56:46,382 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-08 23:56:46,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:46,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash 393725869, now seen corresponding path program 1 times [2024-11-08 23:56:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:56:46,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537100791] [2024-11-08 23:56:46,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:46,386 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-08 23:56:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:56:46,388 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-08 23:56:46,389 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-08 23:56:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:46,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:56:46,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:56:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-08 23:56:46,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:56:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 23:56:47,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:56:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537100791] [2024-11-08 23:56:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537100791] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:56:47,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:56:47,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 23:56:47,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690833056] [2024-11-08 23:56:47,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:56:47,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:56:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:56:47,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:56:47,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:56:47,213 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 23:56:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:56:47,941 INFO L93 Difference]: Finished difference Result 107 states and 150 transitions. [2024-11-08 23:56:47,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:56:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 125 [2024-11-08 23:56:47,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:56:47,973 INFO L225 Difference]: With dead ends: 107 [2024-11-08 23:56:47,973 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 23:56:47,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:56:47,975 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:56:47,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 99 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:56:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 23:56:47,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-08 23:56:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 23:56:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-11-08 23:56:47,999 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 125 [2024-11-08 23:56:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:56:48,003 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-11-08 23:56:48,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-08 23:56:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-11-08 23:56:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 23:56:48,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:56:48,005 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:56:48,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:56:48,206 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-08 23:56:48,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:56:48,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:56:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash 395572911, now seen corresponding path program 1 times [2024-11-08 23:56:48,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:56:48,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469195963] [2024-11-08 23:56:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:56:48,216 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-08 23:56:48,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:56:48,220 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-08 23:56:48,224 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-08 23:56:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:56:48,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 23:56:48,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:57:14,340 WARN L286 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 23:57:37,169 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)