./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.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-1.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 21a1125ae0cc2adce78274abe3bb5e8e98d6a4c7db57dc682e7d7594a508e739 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:45:20,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:45:20,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:45:20,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:45:20,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:45:21,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:45:21,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:45:21,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:45:21,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:45:21,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:45:21,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:45:21,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:45:21,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:45:21,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:45:21,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:45:21,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:45:21,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:45:21,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:45:21,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:45:21,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:45:21,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:45:21,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:45:21,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:45:21,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:45:21,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:45:21,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:45:21,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:45:21,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:45:21,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:45:21,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:45:21,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:45:21,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:45:21,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:45:21,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:45:21,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:45:21,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:45:21,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:45:21,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:45:21,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:45:21,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:45:21,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:45:21,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:45:21,045 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 -> 21a1125ae0cc2adce78274abe3bb5e8e98d6a4c7db57dc682e7d7594a508e739 [2024-11-12 04:45:21,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:45:21,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:45:21,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:45:21,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:45:21,418 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:45:21,420 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-1.i [2024-11-12 04:45:22,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:45:23,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:45:23,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-1.i [2024-11-12 04:45:23,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e540b053/5be70dbaab01438f82aecccd3ab0561d/FLAGe1c8548c2 [2024-11-12 04:45:23,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e540b053/5be70dbaab01438f82aecccd3ab0561d [2024-11-12 04:45:23,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:45:23,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:45:23,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:45:23,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:45:23,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:45:23,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b4787e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23, skipping insertion in model container [2024-11-12 04:45:23,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:45:23,400 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-1.i[915,928] [2024-11-12 04:45:23,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:45:23,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:45:23,464 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-1.i[915,928] [2024-11-12 04:45:23,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:45:23,511 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:45:23,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23 WrapperNode [2024-11-12 04:45:23,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:45:23,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:45:23,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:45:23,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:45:23,523 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:45:23" (1/1) ... [2024-11-12 04:45:23,532 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:45:23" (1/1) ... [2024-11-12 04:45:23,560 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-12 04:45:23,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:45:23,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:45:23,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:45:23,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:45:23,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,605 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:45:23,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:45:23,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:45:23,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:45:23,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:45:23,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (1/1) ... [2024-11-12 04:45:23,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:45:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:45:23,670 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:45:23,674 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:45:23,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:45:23,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:45:23,756 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:45:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:45:23,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:45:23,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:45:23,900 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:45:23,905 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:45:24,237 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 04:45:24,237 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:45:24,255 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:45:24,256 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:45:24,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:24 BoogieIcfgContainer [2024-11-12 04:45:24,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:45:24,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:45:24,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:45:24,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:45:24,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:45:23" (1/3) ... [2024-11-12 04:45:24,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14836711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:24, skipping insertion in model container [2024-11-12 04:45:24,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:45:23" (2/3) ... [2024-11-12 04:45:24,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14836711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:45:24, skipping insertion in model container [2024-11-12 04:45:24,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:24" (3/3) ... [2024-11-12 04:45:24,265 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-1.i [2024-11-12 04:45:24,278 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:45:24,279 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:45:24,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:45:24,361 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;@e90f023, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:45:24,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:45:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:45:24,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 04:45:24,377 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:24,378 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:24,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:24,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash 119796604, now seen corresponding path program 1 times [2024-11-12 04:45:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781340573] [2024-11-12 04:45:24,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:24,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781340573] [2024-11-12 04:45:24,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781340573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:24,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:24,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:45:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289446260] [2024-11-12 04:45:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:24,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:45:24,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:24,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:45:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:45:24,838 INFO L87 Difference]: Start difference. First operand has 61 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 04:45:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:24,872 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2024-11-12 04:45:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:45:24,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 112 [2024-11-12 04:45:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:24,885 INFO L225 Difference]: With dead ends: 115 [2024-11-12 04:45:24,885 INFO L226 Difference]: Without dead ends: 57 [2024-11-12 04:45:24,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:45:24,893 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:24,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:45:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-12 04:45:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-12 04:45:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:45:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2024-11-12 04:45:24,944 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 112 [2024-11-12 04:45:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:24,945 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2024-11-12 04:45:24,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-12 04:45:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2024-11-12 04:45:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 04:45:24,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:24,952 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:24,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:45:24,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:24,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:24,955 INFO L85 PathProgramCache]: Analyzing trace with hash -918120518, now seen corresponding path program 1 times [2024-11-12 04:45:24,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:24,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873702604] [2024-11-12 04:45:24,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:24,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873702604] [2024-11-12 04:45:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873702604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:26,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:26,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:45:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152058460] [2024-11-12 04:45:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:26,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:45:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:26,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:45:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:45:26,131 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:26,414 INFO L93 Difference]: Finished difference Result 155 states and 218 transitions. [2024-11-12 04:45:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:45:26,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2024-11-12 04:45:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:26,417 INFO L225 Difference]: With dead ends: 155 [2024-11-12 04:45:26,419 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 04:45:26,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:45:26,422 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 47 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:26,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 283 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:45:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 04:45:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2024-11-12 04:45:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:45:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-12 04:45:26,440 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 112 [2024-11-12 04:45:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:26,443 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-12 04:45:26,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-12 04:45:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 04:45:26,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:26,447 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:45:26,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -659955080, now seen corresponding path program 1 times [2024-11-12 04:45:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480375200] [2024-11-12 04:45:26,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,137 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:27,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480375200] [2024-11-12 04:45:27,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480375200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:27,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:27,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:45:27,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682067046] [2024-11-12 04:45:27,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:27,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:45:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:27,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:45:27,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:45:27,144 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:27,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:27,390 INFO L93 Difference]: Finished difference Result 167 states and 234 transitions. [2024-11-12 04:45:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:45:27,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 112 [2024-11-12 04:45:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:27,394 INFO L225 Difference]: With dead ends: 167 [2024-11-12 04:45:27,396 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 04:45:27,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:45:27,400 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 46 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:27,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 439 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:45:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 04:45:27,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2024-11-12 04:45:27,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:45:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-12 04:45:27,421 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 112 [2024-11-12 04:45:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:27,422 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-12 04:45:27,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-12 04:45:27,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:45:27,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:27,427 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:27,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:45:27,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:27,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash -185023367, now seen corresponding path program 1 times [2024-11-12 04:45:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:27,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876783084] [2024-11-12 04:45:27,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:27,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:27,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:27,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876783084] [2024-11-12 04:45:27,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876783084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:27,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:27,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:45:27,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520133171] [2024-11-12 04:45:27,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:27,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:45:27,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:27,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:45:27,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:45:27,918 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:28,131 INFO L93 Difference]: Finished difference Result 169 states and 237 transitions. [2024-11-12 04:45:28,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:45:28,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-11-12 04:45:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:28,137 INFO L225 Difference]: With dead ends: 169 [2024-11-12 04:45:28,137 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 04:45:28,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:45:28,141 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 73 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:28,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 389 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:45:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 04:45:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2024-11-12 04:45:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:45:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-12 04:45:28,155 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 113 [2024-11-12 04:45:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:28,155 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-12 04:45:28,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-12 04:45:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:45:28,161 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:28,162 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:28,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:45:28,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:28,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1196140617, now seen corresponding path program 1 times [2024-11-12 04:45:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700278549] [2024-11-12 04:45:28,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:28,638 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700278549] [2024-11-12 04:45:28,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700278549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:28,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 04:45:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415647858] [2024-11-12 04:45:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:28,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 04:45:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:28,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 04:45:28,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:45:28,642 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:28,895 INFO L93 Difference]: Finished difference Result 192 states and 264 transitions. [2024-11-12 04:45:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:45:28,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-11-12 04:45:28,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:28,897 INFO L225 Difference]: With dead ends: 192 [2024-11-12 04:45:28,897 INFO L226 Difference]: Without dead ends: 124 [2024-11-12 04:45:28,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:45:28,898 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 104 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:28,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 527 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:45:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-12 04:45:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 71. [2024-11-12 04:45:28,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:45:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-12 04:45:28,916 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 113 [2024-11-12 04:45:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:28,920 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-12 04:45:28,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-12 04:45:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:45:28,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:28,922 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:28,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:45:28,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:28,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash -937975179, now seen corresponding path program 1 times [2024-11-12 04:45:28,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:28,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223890932] [2024-11-12 04:45:28,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:29,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223890932] [2024-11-12 04:45:29,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223890932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:29,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:29,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:45:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002160827] [2024-11-12 04:45:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:45:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:29,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:45:29,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:45:29,382 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:29,588 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2024-11-12 04:45:29,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:45:29,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2024-11-12 04:45:29,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:29,591 INFO L225 Difference]: With dead ends: 192 [2024-11-12 04:45:29,591 INFO L226 Difference]: Without dead ends: 124 [2024-11-12 04:45:29,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:45:29,594 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 76 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:29,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 742 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:45:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-12 04:45:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 59. [2024-11-12 04:45:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-12 04:45:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2024-11-12 04:45:29,604 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 113 [2024-11-12 04:45:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:29,604 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2024-11-12 04:45:29,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2024-11-12 04:45:29,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-12 04:45:29,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:29,606 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:29,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:45:29,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:29,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:29,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1900989205, now seen corresponding path program 1 times [2024-11-12 04:45:29,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:29,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212974546] [2024-11-12 04:45:29,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:29,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:30,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:30,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212974546] [2024-11-12 04:45:30,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212974546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:30,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:30,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 04:45:30,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186762274] [2024-11-12 04:45:30,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:30,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 04:45:30,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:30,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 04:45:30,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-12 04:45:30,271 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:30,790 INFO L93 Difference]: Finished difference Result 127 states and 175 transitions. [2024-11-12 04:45:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 04:45:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 114 [2024-11-12 04:45:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:30,793 INFO L225 Difference]: With dead ends: 127 [2024-11-12 04:45:30,794 INFO L226 Difference]: Without dead ends: 125 [2024-11-12 04:45:30,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:45:30,796 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 122 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:30,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 454 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:45:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-12 04:45:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2024-11-12 04:45:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 78 states have internal predecessors, (88), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 04:45:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 170 transitions. [2024-11-12 04:45:30,824 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 170 transitions. Word has length 114 [2024-11-12 04:45:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:30,825 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 170 transitions. [2024-11-12 04:45:30,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 170 transitions. [2024-11-12 04:45:30,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 04:45:30,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:30,826 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:30,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:45:30,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1295387281, now seen corresponding path program 1 times [2024-11-12 04:45:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:30,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344137602] [2024-11-12 04:45:30,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:30,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:30,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:30,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344137602] [2024-11-12 04:45:30,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344137602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:30,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:45:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553497848] [2024-11-12 04:45:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:30,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:45:30,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:30,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:45:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:45:30,926 INFO L87 Difference]: Start difference. First operand 121 states and 170 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:30,990 INFO L93 Difference]: Finished difference Result 279 states and 385 transitions. [2024-11-12 04:45:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:45:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2024-11-12 04:45:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:30,994 INFO L225 Difference]: With dead ends: 279 [2024-11-12 04:45:30,994 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 04:45:30,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:45:30,996 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 49 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:30,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 143 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:45:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 04:45:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-12 04:45:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 114 states have internal predecessors, (125), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 59 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-12 04:45:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2024-11-12 04:45:31,044 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 115 [2024-11-12 04:45:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:31,045 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2024-11-12 04:45:31,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2024-11-12 04:45:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 04:45:31,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:31,047 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:31,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:45:31,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:31,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash 515115771, now seen corresponding path program 1 times [2024-11-12 04:45:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920733384] [2024-11-12 04:45:31,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:31,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:31,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920733384] [2024-11-12 04:45:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920733384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:45:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129182495] [2024-11-12 04:45:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:31,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:45:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:45:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:45:31,144 INFO L87 Difference]: Start difference. First operand 180 states and 251 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:31,211 INFO L93 Difference]: Finished difference Result 312 states and 429 transitions. [2024-11-12 04:45:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:45:31,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2024-11-12 04:45:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:31,214 INFO L225 Difference]: With dead ends: 312 [2024-11-12 04:45:31,215 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 04:45:31,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:45:31,216 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:31,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 166 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:45:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 04:45:31,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 130. [2024-11-12 04:45:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 85 states have internal predecessors, (94), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 04:45:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-11-12 04:45:31,237 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 115 [2024-11-12 04:45:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:31,238 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-11-12 04:45:31,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-11-12 04:45:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-12 04:45:31,239 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:31,240 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:31,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 04:45:31,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:31,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash -956762095, now seen corresponding path program 1 times [2024-11-12 04:45:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:31,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447586404] [2024-11-12 04:45:31,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447586404] [2024-11-12 04:45:31,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447586404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:31,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:31,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:45:31,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484476486] [2024-11-12 04:45:31,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:31,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:45:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:45:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:45:31,652 INFO L87 Difference]: Start difference. First operand 130 states and 176 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:32,108 INFO L93 Difference]: Finished difference Result 173 states and 230 transitions. [2024-11-12 04:45:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:45:32,108 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2024-11-12 04:45:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:32,115 INFO L225 Difference]: With dead ends: 173 [2024-11-12 04:45:32,115 INFO L226 Difference]: Without dead ends: 171 [2024-11-12 04:45:32,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-12 04:45:32,116 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 106 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:32,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 620 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:45:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-12 04:45:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2024-11-12 04:45:32,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 98 states have internal predecessors, (107), 41 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 04:45:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 189 transitions. [2024-11-12 04:45:32,150 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 189 transitions. Word has length 115 [2024-11-12 04:45:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:32,151 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 189 transitions. [2024-11-12 04:45:32,151 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 189 transitions. [2024-11-12 04:45:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:45:32,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:32,154 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:32,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 04:45:32,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:32,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 211692513, now seen corresponding path program 1 times [2024-11-12 04:45:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518450559] [2024-11-12 04:45:32,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:45:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221376521] [2024-11-12 04:45:32,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:32,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:45:32,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:45:32,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:45:32,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:45:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:32,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 04:45:32,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:45:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 235 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-12 04:45:36,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:45:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-12 04:45:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518450559] [2024-11-12 04:45:40,722 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 04:45:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221376521] [2024-11-12 04:45:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221376521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:45:40,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:45:40,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2024-11-12 04:45:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542214678] [2024-11-12 04:45:40,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:45:40,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 04:45:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 04:45:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-11-12 04:45:40,726 INFO L87 Difference]: Start difference. First operand 143 states and 189 transitions. Second operand has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 04:45:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:42,257 INFO L93 Difference]: Finished difference Result 196 states and 251 transitions. [2024-11-12 04:45:42,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 04:45:42,257 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 116 [2024-11-12 04:45:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:42,259 INFO L225 Difference]: With dead ends: 196 [2024-11-12 04:45:42,260 INFO L226 Difference]: Without dead ends: 194 [2024-11-12 04:45:42,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2024-11-12 04:45:42,262 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 136 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:42,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 715 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 04:45:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-12 04:45:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2024-11-12 04:45:42,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.1134020618556701) internal successors, (108), 99 states have internal predecessors, (108), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 04:45:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2024-11-12 04:45:42,283 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 116 [2024-11-12 04:45:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:42,283 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2024-11-12 04:45:42,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 04:45:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2024-11-12 04:45:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:45:42,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:42,287 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:42,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:45:42,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 04:45:42,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:42,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash -561945216, now seen corresponding path program 1 times [2024-11-12 04:45:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:42,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921011095] [2024-11-12 04:45:42,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:42,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:43,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921011095] [2024-11-12 04:45:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921011095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:43,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:43,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:45:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211434800] [2024-11-12 04:45:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:43,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:45:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:45:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:45:43,004 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:43,506 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2024-11-12 04:45:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:45:43,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 116 [2024-11-12 04:45:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:43,508 INFO L225 Difference]: With dead ends: 170 [2024-11-12 04:45:43,509 INFO L226 Difference]: Without dead ends: 168 [2024-11-12 04:45:43,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-12 04:45:43,509 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 72 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:43,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 542 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:45:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-12 04:45:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 146. [2024-11-12 04:45:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.1134020618556701) internal successors, (108), 99 states have internal predecessors, (108), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 04:45:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2024-11-12 04:45:43,525 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 116 [2024-11-12 04:45:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:43,526 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2024-11-12 04:45:43,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2024-11-12 04:45:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:45:43,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:45:43,528 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:43,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 04:45:43,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:45:43,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:45:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -954972226, now seen corresponding path program 1 times [2024-11-12 04:45:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:45:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493906812] [2024-11-12 04:45:43,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:45:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:45:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:45:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:45:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:45:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:45:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:45:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:45:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:45:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:45:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:45:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:45:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:45:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:45:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:45:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:45:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:45:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:45:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:45:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:45:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-12 04:45:44,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:45:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493906812] [2024-11-12 04:45:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493906812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:45:44,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:45:44,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:45:44,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342194367] [2024-11-12 04:45:44,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:45:44,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:45:44,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:45:44,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:45:44,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:45:44,105 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:45:44,728 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2024-11-12 04:45:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:45:44,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 116 [2024-11-12 04:45:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:45:44,729 INFO L225 Difference]: With dead ends: 162 [2024-11-12 04:45:44,730 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 04:45:44,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-12 04:45:44,732 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 77 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:45:44,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 412 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 04:45:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 04:45:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 04:45:44,733 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:45:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 04:45:44,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2024-11-12 04:45:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:45:44,733 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 04:45:44,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-12 04:45:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 04:45:44,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 04:45:44,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:45:44,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 04:45:44,740 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:45:44,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 04:45:45,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:45:45,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:45:45 BoogieIcfgContainer [2024-11-12 04:45:45,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:45:45,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:45:45,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:45:45,412 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:45:45,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:45:24" (3/4) ... [2024-11-12 04:45:45,415 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 04:45:45,419 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 04:45:45,424 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-12 04:45:45,426 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 04:45:45,426 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 04:45:45,426 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 04:45:45,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 04:45:45,540 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 04:45:45,540 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:45:45,541 INFO L158 Benchmark]: Toolchain (without parser) took 22347.13ms. Allocated memory was 134.2MB in the beginning and 524.3MB in the end (delta: 390.1MB). Free memory was 88.3MB in the beginning and 414.1MB in the end (delta: -325.8MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2024-11-12 04:45:45,541 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:45:45,541 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.32ms. Allocated memory is still 134.2MB. Free memory was 88.0MB in the beginning and 74.0MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:45:45,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 134.2MB. Free memory was 74.0MB in the beginning and 71.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:45:45,542 INFO L158 Benchmark]: Boogie Preprocessor took 55.17ms. Allocated memory is still 134.2MB. Free memory was 71.6MB in the beginning and 69.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:45:45,542 INFO L158 Benchmark]: RCFGBuilder took 636.34ms. Allocated memory is still 134.2MB. Free memory was 69.2MB in the beginning and 92.3MB in the end (delta: -23.1MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-12 04:45:45,542 INFO L158 Benchmark]: TraceAbstraction took 21152.46ms. Allocated memory was 134.2MB in the beginning and 524.3MB in the end (delta: 390.1MB). Free memory was 91.4MB in the beginning and 420.4MB in the end (delta: -329.0MB). Peak memory consumption was 305.7MB. Max. memory is 16.1GB. [2024-11-12 04:45:45,543 INFO L158 Benchmark]: Witness Printer took 128.86ms. Allocated memory is still 524.3MB. Free memory was 420.4MB in the beginning and 414.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:45:45,544 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.19ms. Allocated memory is still 96.5MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.32ms. Allocated memory is still 134.2MB. Free memory was 88.0MB in the beginning and 74.0MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 134.2MB. Free memory was 74.0MB in the beginning and 71.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.17ms. Allocated memory is still 134.2MB. Free memory was 71.6MB in the beginning and 69.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 636.34ms. Allocated memory is still 134.2MB. Free memory was 69.2MB in the beginning and 92.3MB in the end (delta: -23.1MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21152.46ms. Allocated memory was 134.2MB in the beginning and 524.3MB in the end (delta: 390.1MB). Free memory was 91.4MB in the beginning and 420.4MB in the end (delta: -329.0MB). Peak memory consumption was 305.7MB. Max. memory is 16.1GB. * Witness Printer took 128.86ms. Allocated memory is still 524.3MB. Free memory was 420.4MB in the beginning and 414.1MB 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, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 13, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 991 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 955 mSDsluCounter, 5514 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4151 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3054 IncrementalHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 1363 mSDtfsCounter, 3054 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 780 GetRequests, 671 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=8, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 350 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 1598 NumberOfCodeBlocks, 1598 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1584 ConstructedInterpolants, 12 QuantifiedInterpolants, 4913 SizeOfPredicates, 13 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 7565/7616 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: 106]: Loop Invariant Derived loop invariant: (((0 <= var_1_11) && (var_1_13 == var_1_16)) || (((var_1_16 != 0) && (0 <= var_1_11)) && (var_1_11 != 0))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (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_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_12 == \old(last_1_var_1_12)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 04:45:45,596 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