./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_variablewrapping_wrapper-s_file-68.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 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:44:23,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:44:23,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:44:23,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:44:23,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:44:23,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:44:23,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:44:23,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:44:23,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:44:23,422 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:44:23,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:44:23,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:44:23,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:44:23,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:44:23,426 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:44:23,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:44:23,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:44:23,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:44:23,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:44:23,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:44:23,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:44:23,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:44:23,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:44:23,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:44:23,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:44:23,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:44:23,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:44:23,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:44:23,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:44:23,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:44:23,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:44:23,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:44:23,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:44:23,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:44:23,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:44:23,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:44:23,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:44:23,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:44:23,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:44:23,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:44:23,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:44:23,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:44:23,438 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 -> 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 [2024-11-12 07:44:23,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:44:23,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:44:23,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:44:23,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:44:23,731 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:44:23,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-11-12 07:44:25,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:44:25,504 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:44:25,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-11-12 07:44:25,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560f29337/23d72eb6bd694abdb2de27f9430c0085/FLAGdb77061d3 [2024-11-12 07:44:25,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/560f29337/23d72eb6bd694abdb2de27f9430c0085 [2024-11-12 07:44:25,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:44:25,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:44:25,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:44:25,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:44:25,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:44:25,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:44:25" (1/1) ... [2024-11-12 07:44:25,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325a65d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:25, skipping insertion in model container [2024-11-12 07:44:25,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:44:25" (1/1) ... [2024-11-12 07:44:25,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:44:26,088 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_variablewrapping_wrapper-s_file-68.i[916,929] [2024-11-12 07:44:26,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:44:26,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:44:26,226 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_variablewrapping_wrapper-s_file-68.i[916,929] [2024-11-12 07:44:26,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:44:26,298 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:44:26,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26 WrapperNode [2024-11-12 07:44:26,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:44:26,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:44:26,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:44:26,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:44:26,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,357 INFO L138 Inliner]: procedures = 30, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 510 [2024-11-12 07:44:26,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:44:26,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:44:26,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:44:26,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:44:26,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,397 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:44:26,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,438 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:44:26,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:44:26,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:44:26,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:44:26,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (1/1) ... [2024-11-12 07:44:26,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:44:26,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:44:26,494 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-12 07:44:26,498 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-12 07:44:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:44:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:44:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:44:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:44:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:44:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:44:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:44:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:44:26,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:44:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:44:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:44:26,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:44:26,716 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:44:26,719 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:44:27,523 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-12 07:44:27,524 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:44:27,548 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:44:27,549 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:44:27,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:27 BoogieIcfgContainer [2024-11-12 07:44:27,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:44:27,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:44:27,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:44:27,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:44:27,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:44:25" (1/3) ... [2024-11-12 07:44:27,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48639e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:44:27, skipping insertion in model container [2024-11-12 07:44:27,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:26" (2/3) ... [2024-11-12 07:44:27,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48639e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:44:27, skipping insertion in model container [2024-11-12 07:44:27,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:27" (3/3) ... [2024-11-12 07:44:27,561 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-68.i [2024-11-12 07:44:27,576 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:44:27,577 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:44:27,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:44:27,647 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;@41dd969b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:44:27,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:44:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 07:44:27,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:27,672 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:27,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:27,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1572021536, now seen corresponding path program 1 times [2024-11-12 07:44:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:27,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661293786] [2024-11-12 07:44:27,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:27,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:28,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661293786] [2024-11-12 07:44:28,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661293786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:28,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:28,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:44:28,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590313129] [2024-11-12 07:44:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:28,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:44:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:28,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:44:28,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:44:28,427 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:44:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:28,476 INFO L93 Difference]: Finished difference Result 221 states and 345 transitions. [2024-11-12 07:44:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:44:28,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-11-12 07:44:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:28,488 INFO L225 Difference]: With dead ends: 221 [2024-11-12 07:44:28,488 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 07:44:28,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:44:28,499 INFO L435 NwaCegarLoop]: 160 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, 160 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-12 07:44:28,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:28,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 07:44:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 07:44:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2024-11-12 07:44:28,572 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2024-11-12 07:44:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:28,574 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2024-11-12 07:44:28,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:44:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2024-11-12 07:44:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 07:44:28,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:28,582 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:28,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:44:28,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:28,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash -727637382, now seen corresponding path program 1 times [2024-11-12 07:44:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:28,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748020773] [2024-11-12 07:44:28,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:29,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:29,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748020773] [2024-11-12 07:44:29,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748020773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:29,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:29,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:44:29,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685875963] [2024-11-12 07:44:29,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:44:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:29,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:44:29,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:29,151 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:44:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:29,222 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-11-12 07:44:29,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:44:29,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-11-12 07:44:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:29,225 INFO L225 Difference]: With dead ends: 219 [2024-11-12 07:44:29,225 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 07:44:29,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:29,227 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:29,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 07:44:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-12 07:44:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2024-11-12 07:44:29,240 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 146 [2024-11-12 07:44:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:29,242 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2024-11-12 07:44:29,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:44:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2024-11-12 07:44:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 07:44:29,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:29,245 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:29,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:44:29,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:29,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1151493564, now seen corresponding path program 1 times [2024-11-12 07:44:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:29,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057109278] [2024-11-12 07:44:29,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:29,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057109278] [2024-11-12 07:44:29,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057109278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:29,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:29,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:29,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870166159] [2024-11-12 07:44:29,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:29,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:44:29,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:29,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:44:29,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:29,721 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:29,776 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2024-11-12 07:44:29,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:44:29,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-12 07:44:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:29,783 INFO L225 Difference]: With dead ends: 224 [2024-11-12 07:44:29,783 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 07:44:29,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:29,785 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:29,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 07:44:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-12 07:44:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-11-12 07:44:29,804 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 146 [2024-11-12 07:44:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:29,805 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-11-12 07:44:29,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-11-12 07:44:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 07:44:29,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:29,813 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:29,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:44:29,813 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:29,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1929675724, now seen corresponding path program 1 times [2024-11-12 07:44:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:29,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716101031] [2024-11-12 07:44:29,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:30,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:30,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716101031] [2024-11-12 07:44:30,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716101031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:30,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:30,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286767538] [2024-11-12 07:44:30,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:30,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:44:30,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:30,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:44:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:30,161 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:30,208 INFO L93 Difference]: Finished difference Result 230 states and 331 transitions. [2024-11-12 07:44:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:44:30,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-12 07:44:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:30,211 INFO L225 Difference]: With dead ends: 230 [2024-11-12 07:44:30,211 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 07:44:30,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:30,216 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:30,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 07:44:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-12 07:44:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2024-11-12 07:44:30,233 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 146 [2024-11-12 07:44:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:30,236 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2024-11-12 07:44:30,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2024-11-12 07:44:30,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:30,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:30,238 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:30,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:44:30,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:30,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1747614455, now seen corresponding path program 1 times [2024-11-12 07:44:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999814028] [2024-11-12 07:44:30,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999814028] [2024-11-12 07:44:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999814028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:44:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859618778] [2024-11-12 07:44:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:30,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:44:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:44:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:30,463 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:30,492 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2024-11-12 07:44:30,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:44:30,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:30,495 INFO L225 Difference]: With dead ends: 232 [2024-11-12 07:44:30,495 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 07:44:30,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:30,499 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:30,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 460 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 07:44:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-12 07:44:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-12 07:44:30,515 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 148 [2024-11-12 07:44:30,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:30,516 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-12 07:44:30,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-12 07:44:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:30,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:30,519 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:30,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:44:30,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:30,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:30,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1846288263, now seen corresponding path program 1 times [2024-11-12 07:44:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902282948] [2024-11-12 07:44:30,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:30,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:30,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:30,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902282948] [2024-11-12 07:44:30,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902282948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:30,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:30,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:44:30,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308408160] [2024-11-12 07:44:30,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:30,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:44:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:44:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:30,757 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:30,790 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2024-11-12 07:44:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:44:30,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:30,794 INFO L225 Difference]: With dead ends: 236 [2024-11-12 07:44:30,796 INFO L226 Difference]: Without dead ends: 121 [2024-11-12 07:44:30,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:30,797 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:30,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 461 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-12 07:44:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-12 07:44:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2024-11-12 07:44:30,815 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 148 [2024-11-12 07:44:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:30,815 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2024-11-12 07:44:30,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:30,816 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2024-11-12 07:44:30,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:30,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:30,817 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:30,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:44:30,818 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:30,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1166229893, now seen corresponding path program 1 times [2024-11-12 07:44:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:30,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98345142] [2024-11-12 07:44:30,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:30,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:31,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:31,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98345142] [2024-11-12 07:44:31,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98345142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:31,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:31,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:44:31,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881397377] [2024-11-12 07:44:31,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:31,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:44:31,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:31,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:44:31,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:31,009 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:31,033 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2024-11-12 07:44:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:44:31,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:31,035 INFO L225 Difference]: With dead ends: 240 [2024-11-12 07:44:31,035 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 07:44:31,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:44:31,037 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:31,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 463 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 07:44:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-12 07:44:31,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-11-12 07:44:31,050 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 148 [2024-11-12 07:44:31,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:31,050 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-11-12 07:44:31,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-12 07:44:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:31,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:31,052 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:31,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:44:31,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:31,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1164382851, now seen corresponding path program 1 times [2024-11-12 07:44:31,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:31,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479927617] [2024-11-12 07:44:31,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479927617] [2024-11-12 07:44:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479927617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:44:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735708620] [2024-11-12 07:44:31,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:31,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:44:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:44:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:44:31,461 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:31,483 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2024-11-12 07:44:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:44:31,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:31,485 INFO L225 Difference]: With dead ends: 241 [2024-11-12 07:44:31,486 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 07:44:31,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:44:31,488 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:31,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 07:44:31,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-12 07:44:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-11-12 07:44:31,501 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 148 [2024-11-12 07:44:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:31,501 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-11-12 07:44:31,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:31,502 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-11-12 07:44:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:31,504 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:31,505 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:31,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:44:31,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:31,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1102343237, now seen corresponding path program 1 times [2024-11-12 07:44:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545533985] [2024-11-12 07:44:31,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:31,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:31,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545533985] [2024-11-12 07:44:31,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545533985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:31,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:31,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540173890] [2024-11-12 07:44:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:31,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:44:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:31,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:44:31,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:31,760 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:32,448 INFO L93 Difference]: Finished difference Result 307 states and 435 transitions. [2024-11-12 07:44:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:44:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:32,451 INFO L225 Difference]: With dead ends: 307 [2024-11-12 07:44:32,451 INFO L226 Difference]: Without dead ends: 188 [2024-11-12 07:44:32,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:44:32,454 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 130 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:32,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 544 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:44:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-12 07:44:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 122. [2024-11-12 07:44:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2024-11-12 07:44:32,461 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 148 [2024-11-12 07:44:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:32,462 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2024-11-12 07:44:32,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:32,462 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2024-11-12 07:44:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:32,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:32,463 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:32,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:44:32,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:32,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2123411591, now seen corresponding path program 1 times [2024-11-12 07:44:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:32,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337173517] [2024-11-12 07:44:32,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:32,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-12 07:44:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:44:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:44:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:44:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:44:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:44:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:44:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 07:44:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:44:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:44:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:44:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 07:44:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 07:44:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 07:44:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 07:44:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 07:44:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 07:44:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:32,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:44:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337173517] [2024-11-12 07:44:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337173517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:32,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:32,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136544627] [2024-11-12 07:44:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:44:32,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:44:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:44:32,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:32,739 INFO L87 Difference]: Start difference. First operand 122 states and 170 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:32,770 INFO L93 Difference]: Finished difference Result 243 states and 340 transitions. [2024-11-12 07:44:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:44:32,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:32,772 INFO L225 Difference]: With dead ends: 243 [2024-11-12 07:44:32,772 INFO L226 Difference]: Without dead ends: 124 [2024-11-12 07:44:32,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:32,773 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:32,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 604 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-12 07:44:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-12 07:44:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2024-11-12 07:44:32,778 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 148 [2024-11-12 07:44:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:32,779 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2024-11-12 07:44:32,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:32,779 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2024-11-12 07:44:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:32,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:32,781 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:32,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:44:32,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:32,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash 337311973, now seen corresponding path program 1 times [2024-11-12 07:44:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:44:32,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533394131] [2024-11-12 07:44:32,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:32,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:44:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:44:32,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333284624] [2024-11-12 07:44:32,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:32,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:44:32,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:44:32,943 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-12 07:44:32,944 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-12 07:44:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:44:33,875 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:44:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:44:34,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:44:34,832 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:44:34,833 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:44:34,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:44:35,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 07:44:35,039 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:44:35,125 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:44:35,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:44:35 BoogieIcfgContainer [2024-11-12 07:44:35,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:44:35,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:44:35,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:44:35,132 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:44:35,132 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:27" (3/4) ... [2024-11-12 07:44:35,135 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:44:35,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:44:35,137 INFO L158 Benchmark]: Toolchain (without parser) took 9271.13ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 105.1MB in the beginning and 246.6MB in the end (delta: -141.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:44:35,137 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 96.5MB. Free memory is still 54.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:44:35,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.34ms. Allocated memory is still 159.4MB. Free memory was 104.7MB in the beginning and 120.8MB in the end (delta: -16.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 07:44:35,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.41ms. Allocated memory is still 159.4MB. Free memory was 120.8MB in the beginning and 117.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:44:35,138 INFO L158 Benchmark]: Boogie Preprocessor took 84.34ms. Allocated memory is still 159.4MB. Free memory was 117.4MB in the beginning and 113.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:44:35,138 INFO L158 Benchmark]: RCFGBuilder took 1105.38ms. Allocated memory is still 159.4MB. Free memory was 113.2MB in the beginning and 78.6MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-12 07:44:35,139 INFO L158 Benchmark]: TraceAbstraction took 7578.00ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 77.6MB in the beginning and 246.6MB in the end (delta: -169.0MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2024-11-12 07:44:35,139 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 287.3MB. Free memory is still 246.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:44:35,141 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.35ms. Allocated memory is still 96.5MB. Free memory is still 54.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.34ms. Allocated memory is still 159.4MB. Free memory was 104.7MB in the beginning and 120.8MB in the end (delta: -16.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.41ms. Allocated memory is still 159.4MB. Free memory was 120.8MB in the beginning and 117.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.34ms. Allocated memory is still 159.4MB. Free memory was 117.4MB in the beginning and 113.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1105.38ms. Allocated memory is still 159.4MB. Free memory was 113.2MB in the beginning and 78.6MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7578.00ms. Allocated memory was 159.4MB in the beginning and 287.3MB in the end (delta: 127.9MB). Free memory was 77.6MB in the beginning and 246.6MB in the end (delta: -169.0MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 287.3MB. Free memory is still 246.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L61] signed short int last_1_WrapperStruct00_var_1_13 = -25; [L62] signed long int last_1_WrapperStruct00_var_1_17 = 5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L125] EXPR WrapperStruct00.var_1_13 [L125] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_17 [L126] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L96] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L109] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_12 [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_12 [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L112] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L115] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L117] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ulong() [L121] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L137] RET updateVariables() [L138] CALL step() [L66] EXPR WrapperStruct00.var_1_8 [L66] signed long int stepLocal_2 = WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17; [L67] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_2=16] [L67] COND FALSE !(WrapperStruct00.var_1_9) [L74] EXPR WrapperStruct00.var_1_15 [L74] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_15 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] WrapperStruct00.var_1_17 = (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14) [L77] EXPR WrapperStruct00.var_1_19 [L77] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L78] EXPR WrapperStruct00.var_1_12 [L78] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_12 [L79] EXPR WrapperStruct00.var_1_17 [L79] WrapperStruct00.var_1_21 = WrapperStruct00.var_1_17 [L80] EXPR WrapperStruct00.var_1_17 [L80] signed long int stepLocal_1 = WrapperStruct00.var_1_17; [L81] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_1=-10, stepLocal_2=16] [L81] COND FALSE !(stepLocal_1 != WrapperStruct00.var_1_21) [L84] EXPR WrapperStruct00.var_1_18 [L84] EXPR WrapperStruct00.var_1_21 [L84] unsigned long int stepLocal_0 = WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21; [L85] EXPR WrapperStruct00.var_1_2 [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=-4294967297, stepLocal_2=16] [L85] COND FALSE !((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) [L90] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5, stepLocal_0=-4294967297, stepLocal_2=16] [L90] COND FALSE !(WrapperStruct00.var_1_9) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR WrapperStruct00.var_1_2 [L129] EXPR WrapperStruct00.var_1_3 [L129] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1) [L129] EXPR WrapperStruct00.var_1_18 [L129] EXPR WrapperStruct00.var_1_21 [L129] EXPR WrapperStruct00.var_1_13 [L129] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1 [L129] EXPR WrapperStruct00.var_1_1 [L129] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21) [L129] EXPR WrapperStruct00.var_1_21 [L129] EXPR ((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129-L130] return ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 11, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 4699 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3096 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 455 IncrementalHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1603 mSDtfsCounter, 455 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=10, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1768 NumberOfCodeBlocks, 1768 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1462 ConstructedInterpolants, 0 QuantifiedInterpolants, 1633 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 5440/5440 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-12 07:44:35,179 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_variablewrapping_wrapper-s_file-68.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 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:44:37,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:44:37,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:44:37,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:44:37,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:44:37,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:44:37,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:44:37,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:44:37,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:44:37,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:44:37,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:44:37,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:44:37,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:44:37,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:44:37,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:44:37,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:44:37,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:44:37,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:44:37,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:44:37,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:44:37,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:44:37,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:44:37,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:44:37,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:44:37,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:44:37,535 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:44:37,535 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:44:37,535 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:44:37,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:44:37,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:44:37,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:44:37,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:44:37,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:44:37,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:44:37,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:44:37,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:44:37,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:44:37,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:44:37,539 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:44:37,539 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:44:37,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:44:37,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:44:37,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:44:37,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:44:37,541 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 -> 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 [2024-11-12 07:44:37,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:44:37,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:44:37,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:44:37,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:44:37,888 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:44:37,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-11-12 07:44:39,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:44:39,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:44:39,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-11-12 07:44:39,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e1e5bc6/042606dcb7cb47b69a871ab91de0a6da/FLAG515e85b9e [2024-11-12 07:44:40,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0e1e5bc6/042606dcb7cb47b69a871ab91de0a6da [2024-11-12 07:44:40,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:44:40,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:44:40,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:44:40,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:44:40,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:44:40,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3ee8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40, skipping insertion in model container [2024-11-12 07:44:40,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:44:40,320 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_variablewrapping_wrapper-s_file-68.i[916,929] [2024-11-12 07:44:40,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:44:40,417 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:44:40,431 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_variablewrapping_wrapper-s_file-68.i[916,929] [2024-11-12 07:44:40,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:44:40,521 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:44:40,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40 WrapperNode [2024-11-12 07:44:40,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:44:40,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:44:40,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:44:40,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:44:40,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,603 INFO L138 Inliner]: procedures = 40, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2024-11-12 07:44:40,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:44:40,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:44:40,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:44:40,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:44:40,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,665 INFO L175 MemorySlicer]: Split 143 memory accesses to 2 slices as follows [2, 141]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 38 writes are split as follows [0, 38]. [2024-11-12 07:44:40,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:44:40,726 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:44:40,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:44:40,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:44:40,727 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (1/1) ... [2024-11-12 07:44:40,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:44:40,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:44:40,779 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-12 07:44:40,783 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-12 07:44:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:44:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:44:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:44:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-12 07:44:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-12 07:44:40,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:44:40,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:44:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:44:40,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:44:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:44:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:44:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:44:40,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:44:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:44:40,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:44:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:44:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:44:40,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:44:40,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:44:41,004 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:44:41,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:44:44,398 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-12 07:44:44,398 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:44:44,419 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:44:44,419 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:44:44,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:44 BoogieIcfgContainer [2024-11-12 07:44:44,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:44:44,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:44:44,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:44:44,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:44:44,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:44:40" (1/3) ... [2024-11-12 07:44:44,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2907d972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:44:44, skipping insertion in model container [2024-11-12 07:44:44,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:44:40" (2/3) ... [2024-11-12 07:44:44,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2907d972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:44:44, skipping insertion in model container [2024-11-12 07:44:44,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:44:44" (3/3) ... [2024-11-12 07:44:44,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-68.i [2024-11-12 07:44:44,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:44:44,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:44:44,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:44:44,522 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;@578009e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:44:44,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:44:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:44,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 07:44:44,559 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:44,560 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:44,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:44,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:44,567 INFO L85 PathProgramCache]: Analyzing trace with hash -396336112, now seen corresponding path program 1 times [2024-11-12 07:44:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433666191] [2024-11-12 07:44:44,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:44,586 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-12 07:44:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:44,589 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-12 07:44:44,591 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-12 07:44:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:45,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:44:45,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-12 07:44:45,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:45,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:45,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433666191] [2024-11-12 07:44:45,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433666191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:45,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:45,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:44:45,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287129826] [2024-11-12 07:44:45,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:45,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:44:45,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:45,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:44:45,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:44:45,220 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:44:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:45,252 INFO L93 Difference]: Finished difference Result 221 states and 345 transitions. [2024-11-12 07:44:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:44:45,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-11-12 07:44:45,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:45,262 INFO L225 Difference]: With dead ends: 221 [2024-11-12 07:44:45,262 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 07:44:45,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-12 07:44:45,269 INFO L435 NwaCegarLoop]: 160 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, 160 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-12 07:44:45,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 07:44:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 07:44:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2024-11-12 07:44:45,324 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 146 [2024-11-12 07:44:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:45,324 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2024-11-12 07:44:45,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:44:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2024-11-12 07:44:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 07:44:45,328 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:45,328 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:45,343 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-12 07:44:45,529 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-12 07:44:45,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash 448048042, now seen corresponding path program 1 times [2024-11-12 07:44:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186923876] [2024-11-12 07:44:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:45,531 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-12 07:44:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:45,535 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-12 07:44:45,536 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-12 07:44:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:46,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:44:46,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:46,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:46,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:46,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186923876] [2024-11-12 07:44:46,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186923876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:46,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:46,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039972567] [2024-11-12 07:44:46,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:44:46,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:44:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:46,174 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:46,276 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2024-11-12 07:44:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:44:46,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-12 07:44:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:46,280 INFO L225 Difference]: With dead ends: 220 [2024-11-12 07:44:46,280 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 07:44:46,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:46,282 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:46,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:44:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 07:44:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-12 07:44:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-11-12 07:44:46,294 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 146 [2024-11-12 07:44:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:46,296 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-11-12 07:44:46,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:46,297 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-11-12 07:44:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 07:44:46,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:46,299 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:46,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 07:44:46,499 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-12 07:44:46,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:46,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1226230202, now seen corresponding path program 1 times [2024-11-12 07:44:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135738565] [2024-11-12 07:44:46,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:46,502 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-12 07:44:46,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:46,506 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-12 07:44:46,507 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-12 07:44:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:47,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:44:47,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:47,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:47,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:47,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135738565] [2024-11-12 07:44:47,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135738565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:47,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:47,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:47,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48909247] [2024-11-12 07:44:47,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:47,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:44:47,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:47,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:44:47,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:47,129 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:47,207 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2024-11-12 07:44:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:44:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-11-12 07:44:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:47,210 INFO L225 Difference]: With dead ends: 226 [2024-11-12 07:44:47,210 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:44:47,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:47,216 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:47,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 618 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:44:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:44:47,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-12 07:44:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2024-11-12 07:44:47,235 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 146 [2024-11-12 07:44:47,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:47,236 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2024-11-12 07:44:47,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2024-11-12 07:44:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:47,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:47,244 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:47,264 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-12 07:44:47,445 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-12 07:44:47,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:47,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash 370033551, now seen corresponding path program 1 times [2024-11-12 07:44:47,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:47,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315365978] [2024-11-12 07:44:47,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:47,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:44:47,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:47,451 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-12 07:44:47,452 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-12 07:44:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:47,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:44:47,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:48,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:48,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315365978] [2024-11-12 07:44:48,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315365978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:48,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:48,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:48,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603661789] [2024-11-12 07:44:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:48,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:44:48,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:44:48,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:48,037 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:48,099 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2024-11-12 07:44:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:44:48,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:48,102 INFO L225 Difference]: With dead ends: 230 [2024-11-12 07:44:48,102 INFO L226 Difference]: Without dead ends: 119 [2024-11-12 07:44:48,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:44:48,104 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:48,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 604 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:44:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-12 07:44:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-12 07:44:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2024-11-12 07:44:48,112 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 148 [2024-11-12 07:44:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:48,113 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2024-11-12 07:44:48,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2024-11-12 07:44:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:48,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:48,115 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:48,137 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 (5)] Ended with exit code 0 [2024-11-12 07:44:48,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-12 07:44:48,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:48,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:48,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1071098129, now seen corresponding path program 1 times [2024-11-12 07:44:48,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:48,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027105460] [2024-11-12 07:44:48,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:48,318 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-12 07:44:48,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:48,320 INFO L229 MonitoredProcess]: Starting monitored process 6 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-12 07:44:48,321 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 (6)] Waiting until timeout for monitored process [2024-11-12 07:44:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:48,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 07:44:48,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:48,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:48,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:48,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027105460] [2024-11-12 07:44:48,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027105460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:48,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:48,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:44:48,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067359989] [2024-11-12 07:44:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:48,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:44:48,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:48,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:44:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:44:48,884 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:49,237 INFO L93 Difference]: Finished difference Result 238 states and 340 transitions. [2024-11-12 07:44:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:44:49,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:49,240 INFO L225 Difference]: With dead ends: 238 [2024-11-12 07:44:49,240 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 07:44:49,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:44:49,242 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:49,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 882 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:44:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 07:44:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-11-12 07:44:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2024-11-12 07:44:49,251 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 148 [2024-11-12 07:44:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:49,251 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2024-11-12 07:44:49,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2024-11-12 07:44:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:49,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:49,254 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:49,273 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 (6)] Ended with exit code 0 [2024-11-12 07:44:49,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-12 07:44:49,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:49,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:49,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1448861805, now seen corresponding path program 1 times [2024-11-12 07:44:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043112757] [2024-11-12 07:44:49,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:49,456 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-12 07:44:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:49,457 INFO L229 MonitoredProcess]: Starting monitored process 7 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-12 07:44:49,458 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 (7)] Waiting until timeout for monitored process [2024-11-12 07:44:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:49,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 07:44:49,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:50,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:50,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043112757] [2024-11-12 07:44:50,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043112757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:50,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:50,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:44:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272658830] [2024-11-12 07:44:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:50,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:44:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:44:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:44:50,050 INFO L87 Difference]: Start difference. First operand 122 states and 172 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:50,280 INFO L93 Difference]: Finished difference Result 244 states and 345 transitions. [2024-11-12 07:44:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:44:50,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:50,282 INFO L225 Difference]: With dead ends: 244 [2024-11-12 07:44:50,282 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 07:44:50,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:44:50,283 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:50,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1021 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:44:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 07:44:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-12 07:44:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 105 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2024-11-12 07:44:50,302 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 148 [2024-11-12 07:44:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:50,302 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2024-11-12 07:44:50,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2024-11-12 07:44:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-12 07:44:50,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:50,304 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:50,321 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 (7)] Forceful destruction successful, exit code 0 [2024-11-12 07:44:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-12 07:44:50,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1447014763, now seen corresponding path program 1 times [2024-11-12 07:44:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39278220] [2024-11-12 07:44:50,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:50,507 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-12 07:44:50,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:50,508 INFO L229 MonitoredProcess]: Starting monitored process 8 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-12 07:44:50,509 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 (8)] Waiting until timeout for monitored process [2024-11-12 07:44:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:51,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:44:51,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:51,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:44:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 07:44:51,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:51,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:51,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39278220] [2024-11-12 07:44:51,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39278220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:51,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:51,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000296981] [2024-11-12 07:44:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:51,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:44:51,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:51,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:44:51,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:44:51,182 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:53,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:44:55,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:55,852 INFO L93 Difference]: Finished difference Result 246 states and 346 transitions. [2024-11-12 07:44:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:44:55,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 148 [2024-11-12 07:44:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:55,854 INFO L225 Difference]: With dead ends: 246 [2024-11-12 07:44:55,854 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 07:44:55,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:44:55,855 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 154 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:55,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 453 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-12 07:44:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 07:44:55,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-12 07:44:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3238095238095238) internal successors, (139), 105 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2024-11-12 07:44:55,870 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 148 [2024-11-12 07:44:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:55,870 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2024-11-12 07:44:55,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 07:44:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2024-11-12 07:44:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 07:44:55,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:55,872 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:55,893 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 (8)] Ended with exit code 0 [2024-11-12 07:44:56,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-12 07:44:56,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:56,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1325732517, now seen corresponding path program 1 times [2024-11-12 07:44:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:56,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2068235558] [2024-11-12 07:44:56,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:56,075 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-12 07:44:56,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:56,076 INFO L229 MonitoredProcess]: Starting monitored process 9 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-12 07:44:56,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 07:44:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:44:56,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:44:56,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:44:56,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:44:56,718 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-12 07:44:56,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:44:56,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:44:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2068235558] [2024-11-12 07:44:56,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2068235558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:44:56,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:44:56,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:44:56,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250429220] [2024-11-12 07:44:56,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:44:56,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:44:56,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:44:56,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:44:56,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:44:56,722 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:44:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:44:59,521 INFO L93 Difference]: Finished difference Result 246 states and 344 transitions. [2024-11-12 07:44:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:44:59,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-11-12 07:44:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:44:59,522 INFO L225 Difference]: With dead ends: 246 [2024-11-12 07:44:59,523 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 07:44:59,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:44:59,524 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 143 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:44:59,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 448 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-12 07:44:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 07:44:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-12 07:44:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 105 states have internal predecessors, (138), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:44:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2024-11-12 07:44:59,531 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 150 [2024-11-12 07:44:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:44:59,532 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2024-11-12 07:44:59,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:44:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2024-11-12 07:44:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 07:44:59,533 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:44:59,533 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:44:59,556 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 (9)] Forceful destruction successful, exit code 0 [2024-11-12 07:44:59,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-12 07:44:59,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:44:59,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:44:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash -619345195, now seen corresponding path program 1 times [2024-11-12 07:44:59,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:44:59,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540067190] [2024-11-12 07:44:59,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:44:59,736 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-12 07:44:59,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:44:59,737 INFO L229 MonitoredProcess]: Starting monitored process 10 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-12 07:44:59,738 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 (10)] Waiting until timeout for monitored process [2024-11-12 07:45:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:00,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:45:00,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:00,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:00,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-12 07:45:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:45:00,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:00,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540067190] [2024-11-12 07:45:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540067190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:45:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889640221] [2024-11-12 07:45:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:00,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:45:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:45:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:45:00,387 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:45:02,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:02,703 INFO L93 Difference]: Finished difference Result 246 states and 342 transitions. [2024-11-12 07:45:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:45:02,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-12 07:45:02,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:02,704 INFO L225 Difference]: With dead ends: 246 [2024-11-12 07:45:02,704 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 07:45:02,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:45:02,706 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 118 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:02,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 447 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-12 07:45:02,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 07:45:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-12 07:45:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 105 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:45:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2024-11-12 07:45:02,717 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 152 [2024-11-12 07:45:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:02,717 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2024-11-12 07:45:02,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:45:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2024-11-12 07:45:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-12 07:45:02,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:02,719 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:02,740 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 (10)] Forceful destruction successful, exit code 0 [2024-11-12 07:45:02,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-12 07:45:02,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:02,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 634739291, now seen corresponding path program 1 times [2024-11-12 07:45:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176932322] [2024-11-12 07:45:02,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:02,921 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-12 07:45:02,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:02,923 INFO L229 MonitoredProcess]: Starting monitored process 11 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-12 07:45:02,923 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 (11)] Waiting until timeout for monitored process [2024-11-12 07:45:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:45:03,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:45:03,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:45:03,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:45:03,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-12 07:45:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-12 07:45:03,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:45:03,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:45:03,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176932322] [2024-11-12 07:45:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176932322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:45:03,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:45:03,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:45:03,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683709752] [2024-11-12 07:45:03,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:45:03,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:45:03,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:45:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:45:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:45:03,601 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:45:04,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:45:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:45:06,699 INFO L93 Difference]: Finished difference Result 246 states and 340 transitions. [2024-11-12 07:45:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:45:06,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2024-11-12 07:45:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:45:06,701 INFO L225 Difference]: With dead ends: 246 [2024-11-12 07:45:06,702 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 07:45:06,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:45:06,703 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:45:06,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 441 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-12 07:45:06,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 07:45:06,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2024-11-12 07:45:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 07:45:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2024-11-12 07:45:06,715 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 154 [2024-11-12 07:45:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:45:06,716 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2024-11-12 07:45:06,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 07:45:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2024-11-12 07:45:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-12 07:45:06,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:45:06,718 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:45:06,739 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 (11)] Ended with exit code 0 [2024-11-12 07:45:06,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-12 07:45:06,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:45:06,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:45:06,920 INFO L85 PathProgramCache]: Analyzing trace with hash -845520363, now seen corresponding path program 1 times [2024-11-12 07:45:06,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:45:06,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793124033] [2024-11-12 07:45:06,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:45:06,920 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-12 07:45:06,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:45:06,923 INFO L229 MonitoredProcess]: Starting monitored process 12 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-12 07:45:06,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process