./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.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_floatingpointinfluence_no-floats_file-88.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 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:53:35,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:53:35,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:53:35,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:53:35,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:53:35,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:53:35,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:53:35,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:53:35,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:53:35,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:53:35,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:53:35,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:53:35,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:53:35,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:53:35,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:53:35,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:53:35,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:53:35,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:53:35,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:53:35,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:53:35,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:53:35,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:53:35,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:53:35,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:53:35,470 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:53:35,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:53:35,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:53:35,471 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:53:35,471 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:53:35,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:53:35,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:53:35,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:53:35,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:53:35,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:53:35,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:53:35,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:53:35,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:53:35,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:53:35,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:53:35,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:53:35,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:53:35,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:53:35,475 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 -> 76e63db8a1f11506a4aa82d105c50692fc5fb5205570dd5e3435037592a7b2ae [2024-11-12 04:53:35,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:53:35,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:53:35,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:53:35,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:53:35,764 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:53:35,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-12 04:53:37,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:53:37,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:53:37,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-12 04:53:37,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2449350/8f046a7f4068404080e4320bc697515e/FLAG7c5810baa [2024-11-12 04:53:37,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2449350/8f046a7f4068404080e4320bc697515e [2024-11-12 04:53:37,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:53:37,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:53:37,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:53:37,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:53:37,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:53:37,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6769c912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37, skipping insertion in model container [2024-11-12 04:53:37,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:53:37,745 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_floatingpointinfluence_no-floats_file-88.i[916,929] [2024-11-12 04:53:37,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:53:37,802 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:53:37,812 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_floatingpointinfluence_no-floats_file-88.i[916,929] [2024-11-12 04:53:37,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:53:37,852 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:53:37,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37 WrapperNode [2024-11-12 04:53:37,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:53:37,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:53:37,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:53:37,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:53:37,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,943 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-12 04:53:37,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:53:37,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:53:37,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:53:37,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:53:37,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,980 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:53:37,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:37,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:53:37,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:53:37,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:53:37,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:53:37,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (1/1) ... [2024-11-12 04:53:38,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:53:38,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:53:38,037 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 04:53:38,043 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 04:53:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:53:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:53:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:53:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:53:38,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:53:38,184 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:53:38,186 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:53:38,523 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-12 04:53:38,524 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:53:38,541 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:53:38,541 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:53:38,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:53:38 BoogieIcfgContainer [2024-11-12 04:53:38,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:53:38,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:53:38,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:53:38,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:53:38,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:53:37" (1/3) ... [2024-11-12 04:53:38,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e053bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:53:38, skipping insertion in model container [2024-11-12 04:53:38,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:53:37" (2/3) ... [2024-11-12 04:53:38,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e053bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:53:38, skipping insertion in model container [2024-11-12 04:53:38,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:53:38" (3/3) ... [2024-11-12 04:53:38,554 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-88.i [2024-11-12 04:53:38,572 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:53:38,572 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:53:38,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:53:38,652 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;@1839d080, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:53:38,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:53:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:53:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:53:38,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:38,668 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:53:38,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:38,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:38,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1173194148, now seen corresponding path program 1 times [2024-11-12 04:53:38,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:53:38,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663444698] [2024-11-12 04:53:38,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:53:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:53:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:38,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:53:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:53:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:53:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:53:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:53:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:53:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:53:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:53:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:53:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:53:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:53:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:53:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:53:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:53:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:53:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:53:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:53:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:53:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:53:39,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663444698] [2024-11-12 04:53:39,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663444698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:39,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:39,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:53:39,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402982690] [2024-11-12 04:53:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:39,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:53:39,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:53:39,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:53:39,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:53:39,188 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:53:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:39,217 INFO L93 Difference]: Finished difference Result 111 states and 188 transitions. [2024-11-12 04:53:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:53:39,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-12 04:53:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:39,225 INFO L225 Difference]: With dead ends: 111 [2024-11-12 04:53:39,225 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 04:53:39,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:53:39,232 INFO L435 NwaCegarLoop]: 81 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, 81 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 04:53:39,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:53:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 04:53:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-12 04:53:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:53:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-11-12 04:53:39,285 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 116 [2024-11-12 04:53:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:39,287 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-11-12 04:53:39,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:53:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-11-12 04:53:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:53:39,291 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:39,291 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:53:39,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:53:39,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:39,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:39,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1962344732, now seen corresponding path program 1 times [2024-11-12 04:53:39,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:53:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179450009] [2024-11-12 04:53:39,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:53:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:53:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:53:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:53:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:53:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:53:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:53:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:53:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:53:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:53:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:53:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:53:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:53:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:53:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:53:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:53:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:53:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:53:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:53:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:53:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:53:41,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179450009] [2024-11-12 04:53:41,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179450009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:41,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:41,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:53:41,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113096676] [2024-11-12 04:53:41,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:41,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:53:41,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:53:41,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:53:41,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:53:41,394 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-12 04:53:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:41,838 INFO L93 Difference]: Finished difference Result 136 states and 194 transitions. [2024-11-12 04:53:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:53:41,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 116 [2024-11-12 04:53:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:41,841 INFO L225 Difference]: With dead ends: 136 [2024-11-12 04:53:41,841 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 04:53:41,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:53:41,843 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 179 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:53:41,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 165 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:53:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 04:53:41,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2024-11-12 04:53:41,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:53:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-11-12 04:53:41,866 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 116 [2024-11-12 04:53:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:41,868 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-11-12 04:53:41,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-12 04:53:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-11-12 04:53:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:53:41,871 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:41,871 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:53:41,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:53:41,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:41,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:41,873 INFO L85 PathProgramCache]: Analyzing trace with hash -557615202, now seen corresponding path program 1 times [2024-11-12 04:53:41,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:53:41,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853594753] [2024-11-12 04:53:41,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:41,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:53:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:53:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:53:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:53:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:53:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:53:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:53:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:53:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:53:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:53:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:53:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:53:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:53:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:53:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:53:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:53:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:53:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:53:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:53:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:53:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:53:42,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853594753] [2024-11-12 04:53:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853594753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:42,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:42,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:53:42,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925298923] [2024-11-12 04:53:42,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:42,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:53:42,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:53:42,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:53:42,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:53:42,399 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:42,589 INFO L93 Difference]: Finished difference Result 181 states and 259 transitions. [2024-11-12 04:53:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:53:42,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-12 04:53:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:42,592 INFO L225 Difference]: With dead ends: 181 [2024-11-12 04:53:42,592 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 04:53:42,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:53:42,595 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:53:42,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 208 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:53:42,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 04:53:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2024-11-12 04:53:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 04:53:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2024-11-12 04:53:42,627 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 116 [2024-11-12 04:53:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:42,627 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2024-11-12 04:53:42,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2024-11-12 04:53:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 04:53:42,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:42,630 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:53:42,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:53:42,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:42,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash 917685196, now seen corresponding path program 1 times [2024-11-12 04:53:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:53:42,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461293354] [2024-11-12 04:53:42,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:42,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:53:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:53:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:53:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:53:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:53:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:53:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:53:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:53:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:53:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:53:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:53:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:53:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:53:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:53:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:53:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:53:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:53:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:53:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:53:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:53:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:53:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461293354] [2024-11-12 04:53:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461293354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:42,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:42,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:53:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119427279] [2024-11-12 04:53:42,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:42,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:53:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:53:42,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:53:42,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:53:42,860 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:43,021 INFO L93 Difference]: Finished difference Result 192 states and 274 transitions. [2024-11-12 04:53:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:53:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-12 04:53:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:43,025 INFO L225 Difference]: With dead ends: 192 [2024-11-12 04:53:43,028 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 04:53:43,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:53:43,029 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 54 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:53:43,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 212 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:53:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 04:53:43,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2024-11-12 04:53:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 73 states have internal predecessors, (90), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 04:53:43,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-12 04:53:43,067 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 118 [2024-11-12 04:53:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:43,067 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-12 04:53:43,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-12 04:53:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 04:53:43,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:43,070 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:53:43,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:53:43,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1657814146, now seen corresponding path program 1 times [2024-11-12 04:53:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:53:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447632263] [2024-11-12 04:53:43,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:53:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:53:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:53:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:53:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:53:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:53:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:53:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:53:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:53:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:53:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:53:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:53:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:53:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:53:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:53:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:53:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:53:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:53:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:53:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:53:43,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:53:43,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447632263] [2024-11-12 04:53:43,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447632263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:43,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:43,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:53:43,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27854590] [2024-11-12 04:53:43,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:43,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:53:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:53:43,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:53:43,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:53:43,398 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:43,693 INFO L93 Difference]: Finished difference Result 211 states and 289 transitions. [2024-11-12 04:53:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 04:53:43,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-12 04:53:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:43,696 INFO L225 Difference]: With dead ends: 211 [2024-11-12 04:53:43,696 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 04:53:43,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:53:43,697 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 145 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:53:43,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 344 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:53:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 04:53:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2024-11-12 04:53:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 04:53:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2024-11-12 04:53:43,749 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 120 [2024-11-12 04:53:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:43,750 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2024-11-12 04:53:43,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2024-11-12 04:53:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 04:53:43,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:43,758 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:53:43,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:53:43,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:43,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:43,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2079707078, now seen corresponding path program 1 times [2024-11-12 04:53:43,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:53:43,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515003071] [2024-11-12 04:53:43,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:43,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:53:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:53:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:53:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:53:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:53:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:53:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:53:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:53:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:53:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:53:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:53:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:53:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:53:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:53:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:53:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:53:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:53:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:53:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:53:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:53:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:53:46,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515003071] [2024-11-12 04:53:46,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515003071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:46,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:46,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:53:46,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304546150] [2024-11-12 04:53:46,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:46,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:53:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:53:46,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:53:46,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:53:46,676 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:47,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:47,315 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2024-11-12 04:53:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:53:47,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-12 04:53:47,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:47,318 INFO L225 Difference]: With dead ends: 130 [2024-11-12 04:53:47,318 INFO L226 Difference]: Without dead ends: 128 [2024-11-12 04:53:47,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 04:53:47,319 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 62 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:53:47,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 433 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:53:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-12 04:53:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2024-11-12 04:53:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 04:53:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2024-11-12 04:53:47,343 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 120 [2024-11-12 04:53:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:47,344 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2024-11-12 04:53:47,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2024-11-12 04:53:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 04:53:47,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:53:47,346 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:53:47,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:53:47,346 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:53:47,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:53:47,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1399648708, now seen corresponding path program 1 times [2024-11-12 04:53:47,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:53:47,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695957366] [2024-11-12 04:53:47,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:53:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:53:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:53:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:53:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:53:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:53:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:53:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:53:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:53:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:53:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:53:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:53:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:53:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:53:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:53:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:53:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:53:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:53:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:53:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:53:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:53:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:53:49,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:53:49,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695957366] [2024-11-12 04:53:49,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695957366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:53:49,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:53:49,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:53:49,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070063951] [2024-11-12 04:53:49,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:53:49,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:53:49,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:53:49,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:53:49,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:53:49,698 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:53:50,040 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2024-11-12 04:53:50,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:53:50,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-12 04:53:50,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:53:50,041 INFO L225 Difference]: With dead ends: 128 [2024-11-12 04:53:50,041 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 04:53:50,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:53:50,043 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:53:50,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 356 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:53:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 04:53:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 04:53:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 04:53:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 04:53:50,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-11-12 04:53:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:53:50,047 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 04:53:50,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:53:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 04:53:50,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 04:53:50,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:53:50,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:53:50,055 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:53:50,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 04:53:51,740 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:53:51,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:53:51 BoogieIcfgContainer [2024-11-12 04:53:51,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:53:51,767 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:53:51,767 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:53:51,767 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:53:51,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:53:38" (3/4) ... [2024-11-12 04:53:51,769 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 04:53:51,773 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 04:53:51,779 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-12 04:53:51,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 04:53:51,780 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 04:53:51,781 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 04:53:51,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 04:53:51,887 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 04:53:51,888 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:53:51,888 INFO L158 Benchmark]: Toolchain (without parser) took 14380.39ms. Allocated memory was 190.8MB in the beginning and 408.9MB in the end (delta: 218.1MB). Free memory was 121.9MB in the beginning and 165.3MB in the end (delta: -43.5MB). Peak memory consumption was 177.0MB. Max. memory is 16.1GB. [2024-11-12 04:53:51,888 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:53:51,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.51ms. Allocated memory is still 190.8MB. Free memory was 121.6MB in the beginning and 107.2MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:53:51,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.41ms. Allocated memory is still 190.8MB. Free memory was 107.2MB in the beginning and 163.3MB in the end (delta: -56.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:53:51,889 INFO L158 Benchmark]: Boogie Preprocessor took 49.95ms. Allocated memory is still 190.8MB. Free memory was 163.3MB in the beginning and 160.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:53:51,889 INFO L158 Benchmark]: RCFGBuilder took 546.85ms. Allocated memory is still 190.8MB. Free memory was 160.3MB in the beginning and 142.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:53:51,889 INFO L158 Benchmark]: TraceAbstraction took 13220.25ms. Allocated memory was 190.8MB in the beginning and 408.9MB in the end (delta: 218.1MB). Free memory was 141.4MB in the beginning and 171.7MB in the end (delta: -30.2MB). Peak memory consumption was 226.5MB. Max. memory is 16.1GB. [2024-11-12 04:53:51,890 INFO L158 Benchmark]: Witness Printer took 121.13ms. Allocated memory is still 408.9MB. Free memory was 171.7MB in the beginning and 165.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:53:51,891 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.51ms. Allocated memory is still 190.8MB. Free memory was 121.6MB in the beginning and 107.2MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.41ms. Allocated memory is still 190.8MB. Free memory was 107.2MB in the beginning and 163.3MB in the end (delta: -56.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.95ms. Allocated memory is still 190.8MB. Free memory was 163.3MB in the beginning and 160.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 546.85ms. Allocated memory is still 190.8MB. Free memory was 160.3MB in the beginning and 142.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13220.25ms. Allocated memory was 190.8MB in the beginning and 408.9MB in the end (delta: 218.1MB). Free memory was 141.4MB in the beginning and 171.7MB in the end (delta: -30.2MB). Peak memory consumption was 226.5MB. Max. memory is 16.1GB. * Witness Printer took 121.13ms. Allocated memory is still 408.9MB. Free memory was 171.7MB in the beginning and 165.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 558 mSDsluCounter, 1799 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1235 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 530 IncrementalHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 564 mSDtfsCounter, 530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, InterpolantAutomatonStates: 44, 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, 7 MinimizatonAttempts, 73 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 826 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 4788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((16 + var_1_15) == 0) && ((((last_1_var_1_15 >= 0) ? (last_1_var_1_15 / 4294967296) : ((last_1_var_1_15 / 4294967296) - 1)) + 1) <= 0)) && (last_1_var_1_18 == 0)) && (25 == var_1_10)) && (var_1_7 <= 127)) && (last_1_var_1_10 <= (41 + last_1_var_1_15))) && ((var_1_9 == 127) || (var_1_9 < 127))) && (25 <= last_1_var_1_10)) && (var_1_18 == 0)) && (var_1_5 == 0)) && (var_1_1 <= var_1_7)) || (((((var_1_1 == var_1_7) && (var_1_7 <= 127)) && ((((var_1_9 < var_1_7) || (((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == var_1_8) || (127 < ((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)))) && ((((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) == (256 + var_1_8)) || (((var_1_9 >= 0) ? (var_1_9 % 256) : ((var_1_9 % 256) + 256)) < 128)))) && ((((127 < ((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256))) || (((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) == var_1_8)) && ((((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) == (256 + var_1_8)) || (((var_1_7 >= 0) ? (var_1_7 % 256) : ((var_1_7 % 256) + 256)) < 128))) || (var_1_7 < (var_1_9 + 1)))) || (var_1_5 == 0))) && ((var_1_9 == 127) || (var_1_9 < 127))) && (((((var_1_8 + 1) <= 0) && (((long long) var_1_8 + var_1_14) == 0)) || ((0 <= var_1_8) && (var_1_8 == var_1_14))) || (((var_1_8 >= 0) ? (var_1_8 % 4294967296) : ((var_1_8 % 4294967296) + 4294967296)) < var_1_12)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_7 <= 127) && ((var_1_9 == 127) || (var_1_9 < 127))) Ensures: (((var_1_7 <= 127) && ((var_1_9 == 127) || (var_1_9 < 127))) && ((((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (last_1_var_1_10 == \old(last_1_var_1_10))) && (last_1_var_1_15 == \old(last_1_var_1_15))) && (last_1_var_1_18 == \old(last_1_var_1_18)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 04:53:51,932 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 Writing output log to file Ultimate.log Result: TRUE