./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.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 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:08:43,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:08:43,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:08:43,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:08:43,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:08:43,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:08:43,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:08:43,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:08:43,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:08:43,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:08:43,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:08:43,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:08:43,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:08:43,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:08:43,640 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:08:43,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:08:43,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:08:43,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:08:43,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:08:43,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:08:43,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:08:43,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:08:43,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:08:43,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:08:43,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:08:43,647 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:08:43,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:08:43,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:08:43,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:08:43,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:08:43,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:08:43,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:08:43,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:08:43,648 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:08:43,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:08:43,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:08:43,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:08:43,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:08:43,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:08:43,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:08:43,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:08:43,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:08:43,650 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 -> 8509af5ddea8b4969815a398e5f07c16448270bd1737b92218393c93b8a3a0c1 [2024-10-14 10:08:43,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:08:43,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:08:43,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:08:43,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:08:43,908 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:08:43,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2024-10-14 10:08:45,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:08:45,313 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:08:45,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2024-10-14 10:08:45,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59d17f31/bca97d1cec62430089e919da23a1aa84/FLAG0848d5279 [2024-10-14 10:08:45,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b59d17f31/bca97d1cec62430089e919da23a1aa84 [2024-10-14 10:08:45,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:08:45,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:08:45,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:08:45,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:08:45,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:08:45,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@921b513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45, skipping insertion in model container [2024-10-14 10:08:45,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:08:45,502 WARN L248 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_fillercode_fillercodestructure_filler-ps-ci_file-34.i[919,932] [2024-10-14 10:08:45,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:08:45,589 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:08:45,598 WARN L248 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_fillercode_fillercodestructure_filler-ps-ci_file-34.i[919,932] [2024-10-14 10:08:45,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:08:45,648 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:08:45,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45 WrapperNode [2024-10-14 10:08:45,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:08:45,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:08:45,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:08:45,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:08:45,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,707 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-10-14 10:08:45,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:08:45,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:08:45,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:08:45,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:08:45,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,776 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-10-14 10:08:45,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:08:45,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:08:45,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:08:45,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:08:45,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (1/1) ... [2024-10-14 10:08:45,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:08:45,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:45,830 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-10-14 10:08:45,835 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-10-14 10:08:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:08:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:08:45,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:08:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:08:45,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:08:45,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:08:45,957 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:08:45,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:08:46,326 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-14 10:08:46,326 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:08:46,359 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:08:46,361 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:08:46,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:46 BoogieIcfgContainer [2024-10-14 10:08:46,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:08:46,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:08:46,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:08:46,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:08:46,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:08:45" (1/3) ... [2024-10-14 10:08:46,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16255f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:46, skipping insertion in model container [2024-10-14 10:08:46,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:45" (2/3) ... [2024-10-14 10:08:46,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e16255f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:46, skipping insertion in model container [2024-10-14 10:08:46,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:46" (3/3) ... [2024-10-14 10:08:46,370 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-34.i [2024-10-14 10:08:46,386 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:08:46,386 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:08:46,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:08:46,446 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;@6dc3dcce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:08:46,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:08:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.5625) internal successors, (100), 65 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 10:08:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 10:08:46,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:46,466 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:46,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:46,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash 301357568, now seen corresponding path program 1 times [2024-10-14 10:08:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:46,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805812981] [2024-10-14 10:08:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:08:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:08:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:08:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:08:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:08:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:08:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:08:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:08:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:08:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:08:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:08:46,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:46,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805812981] [2024-10-14 10:08:46,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805812981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:46,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:46,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:08:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158936692] [2024-10-14 10:08:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:08:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:46,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:08:46,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:08:46,916 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.5625) internal successors, (100), 65 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 10:08:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:46,955 INFO L93 Difference]: Finished difference Result 171 states and 298 transitions. [2024-10-14 10:08:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:08:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2024-10-14 10:08:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:46,965 INFO L225 Difference]: With dead ends: 171 [2024-10-14 10:08:46,965 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 10:08:46,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:08:46,971 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:46,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:08:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 10:08:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 10:08:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.507936507936508) internal successors, (95), 63 states have internal predecessors, (95), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 10:08:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2024-10-14 10:08:47,034 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 137 [2024-10-14 10:08:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:47,037 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2024-10-14 10:08:47,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 10:08:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2024-10-14 10:08:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 10:08:47,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:47,043 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:47,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:08:47,043 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:47,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1549510084, now seen corresponding path program 1 times [2024-10-14 10:08:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:47,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262211449] [2024-10-14 10:08:47,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:47,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:08:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:08:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:08:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:08:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:08:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:08:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:08:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:08:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:08:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:08:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:08:47,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:47,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262211449] [2024-10-14 10:08:47,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262211449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:47,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:47,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:08:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149731033] [2024-10-14 10:08:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:47,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:08:47,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:47,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:08:47,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:08:47,530 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:08:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:47,687 INFO L93 Difference]: Finished difference Result 282 states and 447 transitions. [2024-10-14 10:08:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:08:47,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-10-14 10:08:47,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:47,690 INFO L225 Difference]: With dead ends: 282 [2024-10-14 10:08:47,691 INFO L226 Difference]: Without dead ends: 198 [2024-10-14 10:08:47,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:08:47,693 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 200 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:47,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 385 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:08:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-14 10:08:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 169. [2024-10-14 10:08:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 10:08:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 269 transitions. [2024-10-14 10:08:47,723 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 269 transitions. Word has length 137 [2024-10-14 10:08:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:47,724 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 269 transitions. [2024-10-14 10:08:47,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:08:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 269 transitions. [2024-10-14 10:08:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 10:08:47,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:47,726 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:47,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:08:47,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:47,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:47,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2066898099, now seen corresponding path program 1 times [2024-10-14 10:08:47,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:47,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424184076] [2024-10-14 10:08:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:47,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:08:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:08:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:08:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:08:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:08:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:08:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:08:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:08:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:08:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:08:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:08:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:48,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424184076] [2024-10-14 10:08:48,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424184076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:48,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:08:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200033175] [2024-10-14 10:08:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:48,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:08:48,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:48,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:08:48,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:08:48,186 INFO L87 Difference]: Start difference. First operand 169 states and 269 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:08:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:48,452 INFO L93 Difference]: Finished difference Result 500 states and 794 transitions. [2024-10-14 10:08:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:08:48,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-10-14 10:08:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:48,456 INFO L225 Difference]: With dead ends: 500 [2024-10-14 10:08:48,456 INFO L226 Difference]: Without dead ends: 332 [2024-10-14 10:08:48,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:08:48,459 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 178 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:48,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 435 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:08:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-14 10:08:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 173. [2024-10-14 10:08:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 130 states have (on average 1.4846153846153847) internal successors, (193), 130 states have internal predecessors, (193), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 10:08:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 273 transitions. [2024-10-14 10:08:48,489 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 273 transitions. Word has length 138 [2024-10-14 10:08:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:48,493 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 273 transitions. [2024-10-14 10:08:48,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:08:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 273 transitions. [2024-10-14 10:08:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 10:08:48,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:48,496 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:48,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:08:48,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:48,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash -202677324, now seen corresponding path program 1 times [2024-10-14 10:08:48,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:48,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013334669] [2024-10-14 10:08:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:09:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:09:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:09:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:09:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:09:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:09:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:09:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:09:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:09:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:09:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:09:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:09:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:09:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:09:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:09:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:09:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:09:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:09:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:09:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:09:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:09:12,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:09:12,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013334669] [2024-10-14 10:09:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013334669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:12,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 10:09:12,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882771601] [2024-10-14 10:09:12,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:12,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 10:09:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:09:12,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 10:09:12,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-14 10:09:12,500 INFO L87 Difference]: Start difference. First operand 173 states and 273 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:15,785 INFO L93 Difference]: Finished difference Result 622 states and 953 transitions. [2024-10-14 10:09:15,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 10:09:15,786 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 10:09:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:15,788 INFO L225 Difference]: With dead ends: 622 [2024-10-14 10:09:15,788 INFO L226 Difference]: Without dead ends: 450 [2024-10-14 10:09:15,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2024-10-14 10:09:15,790 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 362 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:15,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 716 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 10:09:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-14 10:09:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 308. [2024-10-14 10:09:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 244 states have (on average 1.4672131147540983) internal successors, (358), 244 states have internal predecessors, (358), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:09:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 478 transitions. [2024-10-14 10:09:15,822 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 478 transitions. Word has length 139 [2024-10-14 10:09:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:15,824 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 478 transitions. [2024-10-14 10:09:15,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 478 transitions. [2024-10-14 10:09:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 10:09:15,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:15,828 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:15,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:09:15,828 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:15,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash -145419022, now seen corresponding path program 1 times [2024-10-14 10:09:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:09:15,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969415802] [2024-10-14 10:09:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:09:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:09:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:09:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:09:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:09:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:09:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:09:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:09:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:09:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:09:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:09:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:09:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:09:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:09:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:09:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:09:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:09:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:09:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:09:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:09:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:09:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:09:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:09:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969415802] [2024-10-14 10:09:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969415802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:18,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:18,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:09:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402255979] [2024-10-14 10:09:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:18,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:09:18,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:09:18,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:09:18,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:09:18,127 INFO L87 Difference]: Start difference. First operand 308 states and 478 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:19,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:19,157 INFO L93 Difference]: Finished difference Result 701 states and 1082 transitions. [2024-10-14 10:09:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 10:09:19,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 10:09:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:19,161 INFO L225 Difference]: With dead ends: 701 [2024-10-14 10:09:19,161 INFO L226 Difference]: Without dead ends: 513 [2024-10-14 10:09:19,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:09:19,164 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 423 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:19,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 474 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 10:09:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-10-14 10:09:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 353. [2024-10-14 10:09:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 289 states have (on average 1.4567474048442905) internal successors, (421), 289 states have internal predecessors, (421), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:09:19,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 541 transitions. [2024-10-14 10:09:19,204 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 541 transitions. Word has length 139 [2024-10-14 10:09:19,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:19,205 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 541 transitions. [2024-10-14 10:09:19,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:19,205 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 541 transitions. [2024-10-14 10:09:19,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 10:09:19,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:19,206 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:19,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:09:19,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:19,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1012023950, now seen corresponding path program 1 times [2024-10-14 10:09:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:09:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419003151] [2024-10-14 10:09:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:09:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:09:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:09:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:09:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:09:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:09:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:09:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:09:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:09:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:09:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:09:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:09:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:09:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:09:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:09:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:09:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:09:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:09:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:09:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:09:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:09:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:09:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:09:21,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419003151] [2024-10-14 10:09:21,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419003151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:21,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:21,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:09:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021896170] [2024-10-14 10:09:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:21,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:09:21,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:09:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:09:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:09:21,697 INFO L87 Difference]: Start difference. First operand 353 states and 541 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:22,602 INFO L93 Difference]: Finished difference Result 673 states and 1026 transitions. [2024-10-14 10:09:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 10:09:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 10:09:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:22,606 INFO L225 Difference]: With dead ends: 673 [2024-10-14 10:09:22,607 INFO L226 Difference]: Without dead ends: 483 [2024-10-14 10:09:22,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:09:22,609 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 329 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:22,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 476 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 10:09:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-14 10:09:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 373. [2024-10-14 10:09:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 309 states have (on average 1.4724919093851132) internal successors, (455), 309 states have internal predecessors, (455), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:09:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 575 transitions. [2024-10-14 10:09:22,628 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 575 transitions. Word has length 139 [2024-10-14 10:09:22,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:22,629 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 575 transitions. [2024-10-14 10:09:22,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 575 transitions. [2024-10-14 10:09:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 10:09:22,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:22,631 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:22,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:09:22,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:22,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1418918627, now seen corresponding path program 1 times [2024-10-14 10:09:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:09:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556971778] [2024-10-14 10:09:22,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:22,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:09:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:09:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:09:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:09:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:09:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:09:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:09:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:09:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:09:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:09:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:09:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:09:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:09:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:09:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:09:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:09:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:09:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:09:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:09:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:09:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:09:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:09:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:09:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556971778] [2024-10-14 10:09:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556971778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:25,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 10:09:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575983323] [2024-10-14 10:09:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 10:09:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:09:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 10:09:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 10:09:25,227 INFO L87 Difference]: Start difference. First operand 373 states and 575 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:25,564 INFO L93 Difference]: Finished difference Result 695 states and 1061 transitions. [2024-10-14 10:09:25,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 10:09:25,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 10:09:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:25,566 INFO L225 Difference]: With dead ends: 695 [2024-10-14 10:09:25,566 INFO L226 Difference]: Without dead ends: 477 [2024-10-14 10:09:25,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:09:25,567 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 201 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:25,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 408 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:09:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-14 10:09:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 379. [2024-10-14 10:09:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 315 states have (on average 1.457142857142857) internal successors, (459), 315 states have internal predecessors, (459), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:09:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 579 transitions. [2024-10-14 10:09:25,591 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 579 transitions. Word has length 139 [2024-10-14 10:09:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:25,592 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 579 transitions. [2024-10-14 10:09:25,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 579 transitions. [2024-10-14 10:09:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 10:09:25,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:25,593 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:25,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:09:25,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:25,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:25,594 INFO L85 PathProgramCache]: Analyzing trace with hash -789483338, now seen corresponding path program 1 times [2024-10-14 10:09:25,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:09:25,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266263800] [2024-10-14 10:09:25,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:25,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:09:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:09:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:09:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:09:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:09:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:09:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:09:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:09:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:09:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:09:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:09:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:09:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:09:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:09:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:09:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:09:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:09:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:09:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:09:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:09:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:09:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:09:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:09:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266263800] [2024-10-14 10:09:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266263800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:25,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:25,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:09:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137327365] [2024-10-14 10:09:25,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:25,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:09:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:09:25,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:09:25,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:09:25,903 INFO L87 Difference]: Start difference. First operand 379 states and 579 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:26,089 INFO L93 Difference]: Finished difference Result 609 states and 934 transitions. [2024-10-14 10:09:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:09:26,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-10-14 10:09:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:26,092 INFO L225 Difference]: With dead ends: 609 [2024-10-14 10:09:26,092 INFO L226 Difference]: Without dead ends: 377 [2024-10-14 10:09:26,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:09:26,093 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 113 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:26,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 325 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:09:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-14 10:09:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 351. [2024-10-14 10:09:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 287 states have (on average 1.4250871080139373) internal successors, (409), 287 states have internal predecessors, (409), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 10:09:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 529 transitions. [2024-10-14 10:09:26,120 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 529 transitions. Word has length 139 [2024-10-14 10:09:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:26,120 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 529 transitions. [2024-10-14 10:09:26,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 529 transitions. [2024-10-14 10:09:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 10:09:26,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:26,121 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:26,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 10:09:26,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:26,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash 895848696, now seen corresponding path program 1 times [2024-10-14 10:09:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:09:26,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602056049] [2024-10-14 10:09:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:09:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:09:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:09:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:09:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:09:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:09:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:09:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:09:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:09:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:09:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:09:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:09:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:09:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:09:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:09:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:09:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:09:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:09:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:09:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:09:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:09:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:09:33,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:09:33,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602056049] [2024-10-14 10:09:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602056049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:33,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:33,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 10:09:33,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000143527] [2024-10-14 10:09:33,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:33,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 10:09:33,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:09:33,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 10:09:33,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:09:33,567 INFO L87 Difference]: Start difference. First operand 351 states and 529 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:35,490 INFO L93 Difference]: Finished difference Result 910 states and 1339 transitions. [2024-10-14 10:09:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 10:09:35,491 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 10:09:35,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:35,502 INFO L225 Difference]: With dead ends: 910 [2024-10-14 10:09:35,502 INFO L226 Difference]: Without dead ends: 738 [2024-10-14 10:09:35,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-10-14 10:09:35,503 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 441 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:35,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 592 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 10:09:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-14 10:09:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 567. [2024-10-14 10:09:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 494 states have (on average 1.4109311740890689) internal successors, (697), 496 states have internal predecessors, (697), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:09:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 829 transitions. [2024-10-14 10:09:35,559 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 829 transitions. Word has length 140 [2024-10-14 10:09:35,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:35,559 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 829 transitions. [2024-10-14 10:09:35,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 829 transitions. [2024-10-14 10:09:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 10:09:35,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:35,561 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:35,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 10:09:35,561 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1810770698, now seen corresponding path program 1 times [2024-10-14 10:09:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:09:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030470253] [2024-10-14 10:09:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:09:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:09:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:09:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:09:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:09:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:09:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:09:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:09:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:09:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:09:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:09:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:09:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:09:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:09:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:09:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:09:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:09:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:09:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:09:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:09:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:09:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:09:39,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:09:39,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030470253] [2024-10-14 10:09:39,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030470253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:39,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:09:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733014612] [2024-10-14 10:09:39,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:09:39,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:09:39,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:09:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:09:39,963 INFO L87 Difference]: Start difference. First operand 567 states and 829 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:41,215 INFO L93 Difference]: Finished difference Result 1170 states and 1719 transitions. [2024-10-14 10:09:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 10:09:41,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 10:09:41,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:41,222 INFO L225 Difference]: With dead ends: 1170 [2024-10-14 10:09:41,224 INFO L226 Difference]: Without dead ends: 905 [2024-10-14 10:09:41,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:09:41,228 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 237 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:41,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 566 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:09:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-10-14 10:09:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 592. [2024-10-14 10:09:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 517 states have (on average 1.3887814313346227) internal successors, (718), 519 states have internal predecessors, (718), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:09:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 850 transitions. [2024-10-14 10:09:41,273 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 850 transitions. Word has length 140 [2024-10-14 10:09:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:41,274 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 850 transitions. [2024-10-14 10:09:41,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 850 transitions. [2024-10-14 10:09:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 10:09:41,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:41,276 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:41,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 10:09:41,277 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:41,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash 189263808, now seen corresponding path program 1 times [2024-10-14 10:09:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:09:41,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701761695] [2024-10-14 10:09:41,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:41,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:09:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:09:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:09:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:09:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:09:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:09:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:09:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:09:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:09:47,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:09:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:09:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:09:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:09:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:09:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:09:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:09:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:09:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:09:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:09:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:09:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:09:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:09:47,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:09:47,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701761695] [2024-10-14 10:09:47,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701761695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:47,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:47,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 10:09:47,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305100602] [2024-10-14 10:09:47,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:47,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 10:09:47,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:09:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 10:09:47,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 10:09:47,395 INFO L87 Difference]: Start difference. First operand 592 states and 850 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:09:50,029 INFO L93 Difference]: Finished difference Result 1508 states and 2187 transitions. [2024-10-14 10:09:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 10:09:50,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 10:09:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:09:50,034 INFO L225 Difference]: With dead ends: 1508 [2024-10-14 10:09:50,034 INFO L226 Difference]: Without dead ends: 1139 [2024-10-14 10:09:50,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-10-14 10:09:50,036 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 359 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:09:50,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 535 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 10:09:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-14 10:09:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 785. [2024-10-14 10:09:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 710 states have (on average 1.4112676056338027) internal successors, (1002), 712 states have internal predecessors, (1002), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:09:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1134 transitions. [2024-10-14 10:09:50,080 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1134 transitions. Word has length 140 [2024-10-14 10:09:50,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:09:50,081 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1134 transitions. [2024-10-14 10:09:50,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:09:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1134 transitions. [2024-10-14 10:09:50,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-14 10:09:50,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:50,083 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:50,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 10:09:50,084 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:50,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -620082818, now seen corresponding path program 1 times [2024-10-14 10:09:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:09:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866266664] [2024-10-14 10:09:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:09:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:10:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:10:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 10:10:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:10:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:10:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:10:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:10:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:10:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:10:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:10:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:10:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:00,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:10:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:10:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:10:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:10:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:10:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 10:10:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:10:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 10:10:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:10:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:10:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 10:10:01,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:10:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866266664] [2024-10-14 10:10:01,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866266664] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:10:01,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:10:01,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 10:10:01,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711604583] [2024-10-14 10:10:01,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:10:01,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 10:10:01,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:10:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 10:10:01,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-14 10:10:01,052 INFO L87 Difference]: Start difference. First operand 785 states and 1134 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:10:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:10:03,051 INFO L93 Difference]: Finished difference Result 1471 states and 2104 transitions. [2024-10-14 10:10:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 10:10:03,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-10-14 10:10:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:10:03,062 INFO L225 Difference]: With dead ends: 1471 [2024-10-14 10:10:03,063 INFO L226 Difference]: Without dead ends: 1069 [2024-10-14 10:10:03,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2024-10-14 10:10:03,065 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 283 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:10:03,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 768 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 10:10:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-10-14 10:10:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 769. [2024-10-14 10:10:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 694 states have (on average 1.414985590778098) internal successors, (982), 696 states have internal predecessors, (982), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:10:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1114 transitions. [2024-10-14 10:10:03,112 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1114 transitions. Word has length 140 [2024-10-14 10:10:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:10:03,112 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1114 transitions. [2024-10-14 10:10:03,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 10:10:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1114 transitions. [2024-10-14 10:10:03,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 10:10:03,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:10:03,114 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:10:03,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 10:10:03,114 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:10:03,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:10:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1448160105, now seen corresponding path program 1 times [2024-10-14 10:10:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:10:03,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246815618] [2024-10-14 10:10:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:10:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:10:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat