./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w8_d32_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w8_d32_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 56651a36ed493e0e639c74a4009e3ecf23340259e4b22b04b6b0ad71b72e3700 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:19:42,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:19:42,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:19:42,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:19:42,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:19:42,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:19:42,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:19:42,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:19:42,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:19:42,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:19:42,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:19:42,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:19:42,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:19:42,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:19:42,325 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:19:42,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:19:42,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:19:42,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:19:42,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:19:42,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:19:42,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:19:42,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:19:42,332 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:19:42,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:19:42,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:19:42,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:19:42,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:19:42,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:19:42,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:19:42,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:19:42,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:19:42,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:19:42,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:19:42,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:19:42,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:19:42,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:19:42,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:19:42,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:19:42,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:19:42,338 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56651a36ed493e0e639c74a4009e3ecf23340259e4b22b04b6b0ad71b72e3700 [2024-11-10 01:19:42,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:19:42,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:19:42,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:19:42,648 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:19:42,651 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:19:42,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w8_d32_e0.c [2024-11-10 01:19:44,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:19:45,341 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:19:45,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w8_d32_e0.c [2024-11-10 01:19:45,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb971e7ba/4c181d3891924a2c860ff93cc5659652/FLAGe92c788df [2024-11-10 01:19:45,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb971e7ba/4c181d3891924a2c860ff93cc5659652 [2024-11-10 01:19:45,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:19:45,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:19:45,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:19:45,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:19:45,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:19:45,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:19:45" (1/1) ... [2024-11-10 01:19:45,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6654d68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:45, skipping insertion in model container [2024-11-10 01:19:45,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:19:45" (1/1) ... [2024-11-10 01:19:45,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:19:46,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w8_d32_e0.c[1270,1283] [2024-11-10 01:19:46,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:19:47,002 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:19:47,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n5_w8_d32_e0.c[1270,1283] [2024-11-10 01:19:47,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:19:47,462 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:19:47,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47 WrapperNode [2024-11-10 01:19:47,467 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:19:47,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:19:47,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:19:47,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:19:47,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:47,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:50,439 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 13307 [2024-11-10 01:19:50,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:19:50,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:19:50,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:19:50,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:19:50,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:50,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:51,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:51,362 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:19:51,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:51,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:51,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:51,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:52,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:52,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:52,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:19:52,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:19:52,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:19:52,476 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:19:52,477 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (1/1) ... [2024-11-10 01:19:52,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:19:52,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:19:52,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 01:19:52,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 01:19:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:19:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 01:19:52,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 01:19:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:19:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:19:52,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:19:53,646 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:19:53,649 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:20:17,112 INFO L? ?]: Removed 7730 outVars from TransFormulas that were not future-live. [2024-11-10 01:20:17,113 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:20:17,461 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:20:17,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:20:17,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:20:17 BoogieIcfgContainer [2024-11-10 01:20:17,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:20:17,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:20:17,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:20:17,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:20:17,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:19:45" (1/3) ... [2024-11-10 01:20:17,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d20aa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:20:17, skipping insertion in model container [2024-11-10 01:20:17,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:19:47" (2/3) ... [2024-11-10 01:20:17,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d20aa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:20:17, skipping insertion in model container [2024-11-10 01:20:17,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:20:17" (3/3) ... [2024-11-10 01:20:17,474 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n5_w8_d32_e0.c [2024-11-10 01:20:17,496 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:20:17,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:20:17,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:20:17,647 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3459a291, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:20:17,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:20:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 3657 states, 3638 states have (on average 1.496976360637713) internal successors, (5446), 3639 states have internal predecessors, (5446), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:20:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2024-11-10 01:20:17,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:20:17,710 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:20:17,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:20:17,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:20:17,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1871185140, now seen corresponding path program 1 times [2024-11-10 01:20:17,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:20:17,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811467979] [2024-11-10 01:20:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:20:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:20:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:20:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:20:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:20:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:20:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:20:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:20:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:20:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:20:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:20:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 529 [2024-11-10 01:20:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 539 [2024-11-10 01:20:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2024-11-10 01:20:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2024-11-10 01:20:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2024-11-10 01:20:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2024-11-10 01:20:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 599 [2024-11-10 01:20:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:20:19,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:20:19,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811467979] [2024-11-10 01:20:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811467979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:20:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:20:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:20:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697857084] [2024-11-10 01:20:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:20:19,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:20:19,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:20:19,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:20:19,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:20:19,079 INFO L87 Difference]: Start difference. First operand has 3657 states, 3638 states have (on average 1.496976360637713) internal successors, (5446), 3639 states have internal predecessors, (5446), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 436.5) internal successors, (873), 2 states have internal predecessors, (873), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:20:19,982 INFO L93 Difference]: Finished difference Result 6567 states and 9856 transitions. [2024-11-10 01:20:19,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:20:19,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 436.5) internal successors, (873), 2 states have internal predecessors, (873), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 950 [2024-11-10 01:20:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:20:20,014 INFO L225 Difference]: With dead ends: 6567 [2024-11-10 01:20:20,014 INFO L226 Difference]: Without dead ends: 3652 [2024-11-10 01:20:20,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:20:20,028 INFO L432 NwaCegarLoop]: 4569 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:20:20,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4569 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 01:20:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2024-11-10 01:20:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3652. [2024-11-10 01:20:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 3634 states have (on average 1.4966978536048432) internal successors, (5439), 3634 states have internal predecessors, (5439), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:20:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5471 transitions. [2024-11-10 01:20:20,149 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5471 transitions. Word has length 950 [2024-11-10 01:20:20,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:20:20,153 INFO L471 AbstractCegarLoop]: Abstraction has 3652 states and 5471 transitions. [2024-11-10 01:20:20,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 436.5) internal successors, (873), 2 states have internal predecessors, (873), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5471 transitions. [2024-11-10 01:20:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2024-11-10 01:20:20,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:20:20,177 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:20:20,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:20:20,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:20:20,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:20:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2057209988, now seen corresponding path program 1 times [2024-11-10 01:20:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:20:20,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079686995] [2024-11-10 01:20:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:20:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:20:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:20:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:20:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:20:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:20:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:20:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:20:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:20:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:20:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:20:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 529 [2024-11-10 01:20:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 539 [2024-11-10 01:20:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2024-11-10 01:20:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2024-11-10 01:20:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2024-11-10 01:20:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2024-11-10 01:20:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 599 [2024-11-10 01:20:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:20:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:20:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079686995] [2024-11-10 01:20:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079686995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:20:26,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:20:26,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:20:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483492912] [2024-11-10 01:20:26,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:20:26,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:20:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:20:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:20:26,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:20:26,714 INFO L87 Difference]: Start difference. First operand 3652 states and 5471 transitions. Second operand has 4 states, 4 states have (on average 218.25) internal successors, (873), 4 states have internal predecessors, (873), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 01:20:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:20:28,985 INFO L93 Difference]: Finished difference Result 3657 states and 5476 transitions. [2024-11-10 01:20:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:20:28,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 218.25) internal successors, (873), 4 states have internal predecessors, (873), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 950 [2024-11-10 01:20:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:20:29,000 INFO L225 Difference]: With dead ends: 3657 [2024-11-10 01:20:29,001 INFO L226 Difference]: Without dead ends: 3654 [2024-11-10 01:20:29,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:20:29,005 INFO L432 NwaCegarLoop]: 4567 mSDtfsCounter, 0 mSDsluCounter, 9129 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13696 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:20:29,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13696 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 01:20:29,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-11-10 01:20:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2024-11-10 01:20:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3636 states have (on average 1.4964246424642464) internal successors, (5441), 3636 states have internal predecessors, (5441), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:20:29,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5473 transitions. [2024-11-10 01:20:29,149 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5473 transitions. Word has length 950 [2024-11-10 01:20:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:20:29,152 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 5473 transitions. [2024-11-10 01:20:29,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 218.25) internal successors, (873), 4 states have internal predecessors, (873), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 01:20:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5473 transitions. [2024-11-10 01:20:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2024-11-10 01:20:29,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:20:29,163 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:20:29,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:20:29,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:20:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:20:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash -505943089, now seen corresponding path program 1 times [2024-11-10 01:20:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:20:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315309593] [2024-11-10 01:20:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:20:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:20:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:20:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:20:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:20:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:20:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:20:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:20:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:20:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:20:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:20:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 529 [2024-11-10 01:20:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 539 [2024-11-10 01:20:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2024-11-10 01:20:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2024-11-10 01:20:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 575 [2024-11-10 01:20:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 587 [2024-11-10 01:20:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 599 [2024-11-10 01:20:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:20:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:20:32,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315309593] [2024-11-10 01:20:32,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315309593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:20:32,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:20:32,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:20:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104853648] [2024-11-10 01:20:32,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:20:32,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:20:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:20:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:20:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:20:32,338 INFO L87 Difference]: Start difference. First operand 3654 states and 5473 transitions. Second operand has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:20:36,175 INFO L93 Difference]: Finished difference Result 8969 states and 13437 transitions. [2024-11-10 01:20:36,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:20:36,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 951 [2024-11-10 01:20:36,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:20:36,186 INFO L225 Difference]: With dead ends: 8969 [2024-11-10 01:20:36,186 INFO L226 Difference]: Without dead ends: 3654 [2024-11-10 01:20:36,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:20:36,199 INFO L432 NwaCegarLoop]: 4483 mSDtfsCounter, 11000 mSDsluCounter, 8047 mSDsCounter, 0 mSdLazyCounter, 4390 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11007 SdHoareTripleChecker+Valid, 12530 SdHoareTripleChecker+Invalid, 4654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 4390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:20:36,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11007 Valid, 12530 Invalid, 4654 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [264 Valid, 4390 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-10 01:20:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-11-10 01:20:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2024-11-10 01:20:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3636 states have (on average 1.4961496149614961) internal successors, (5440), 3636 states have internal predecessors, (5440), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:20:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5472 transitions. [2024-11-10 01:20:36,287 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5472 transitions. Word has length 951 [2024-11-10 01:20:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:20:36,287 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 5472 transitions. [2024-11-10 01:20:36,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5472 transitions. [2024-11-10 01:20:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2024-11-10 01:20:36,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:20:36,325 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:20:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:20:36,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:20:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:20:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1762023969, now seen corresponding path program 1 times [2024-11-10 01:20:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:20:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042414193] [2024-11-10 01:20:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:20:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:20:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:20:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:20:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:20:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:20:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:20:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:20:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:20:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:20:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:20:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-11-10 01:20:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-11-10 01:20:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-10 01:20:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-10 01:20:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-10 01:20:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2024-11-10 01:20:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-10 01:20:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:20:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:20:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042414193] [2024-11-10 01:20:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042414193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:20:39,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:20:39,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:20:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053383274] [2024-11-10 01:20:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:20:39,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:20:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:20:39,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:20:39,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:20:39,754 INFO L87 Difference]: Start difference. First operand 3654 states and 5472 transitions. Second operand has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:20:42,999 INFO L93 Difference]: Finished difference Result 6566 states and 9832 transitions. [2024-11-10 01:20:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:20:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 952 [2024-11-10 01:20:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:20:43,013 INFO L225 Difference]: With dead ends: 6566 [2024-11-10 01:20:43,013 INFO L226 Difference]: Without dead ends: 3654 [2024-11-10 01:20:43,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-10 01:20:43,019 INFO L432 NwaCegarLoop]: 3527 mSDtfsCounter, 10254 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3899 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10263 SdHoareTripleChecker+Valid, 7056 SdHoareTripleChecker+Invalid, 3900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:20:43,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10263 Valid, 7056 Invalid, 3900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3899 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-10 01:20:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-11-10 01:20:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2024-11-10 01:20:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3636 states have (on average 1.4958745874587458) internal successors, (5439), 3636 states have internal predecessors, (5439), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:20:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5471 transitions. [2024-11-10 01:20:43,104 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5471 transitions. Word has length 952 [2024-11-10 01:20:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:20:43,105 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 5471 transitions. [2024-11-10 01:20:43,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5471 transitions. [2024-11-10 01:20:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 954 [2024-11-10 01:20:43,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:20:43,120 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:20:43,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:20:43,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:20:43,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:20:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash 557166679, now seen corresponding path program 1 times [2024-11-10 01:20:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:20:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481564367] [2024-11-10 01:20:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:20:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:20:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:20:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:20:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:20:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:20:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:20:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:20:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:20:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:20:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:20:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-11-10 01:20:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-11-10 01:20:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-10 01:20:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-10 01:20:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-10 01:20:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2024-11-10 01:20:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-10 01:20:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:20:45,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:20:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481564367] [2024-11-10 01:20:45,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481564367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:20:45,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:20:45,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:20:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116477736] [2024-11-10 01:20:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:20:45,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:20:45,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:20:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:20:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:20:45,740 INFO L87 Difference]: Start difference. First operand 3654 states and 5471 transitions. Second operand has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:20:48,338 INFO L93 Difference]: Finished difference Result 6566 states and 9830 transitions. [2024-11-10 01:20:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:20:48,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 953 [2024-11-10 01:20:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:20:48,360 INFO L225 Difference]: With dead ends: 6566 [2024-11-10 01:20:48,360 INFO L226 Difference]: Without dead ends: 3654 [2024-11-10 01:20:48,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-10 01:20:48,365 INFO L432 NwaCegarLoop]: 3527 mSDtfsCounter, 10126 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3897 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10135 SdHoareTripleChecker+Valid, 7056 SdHoareTripleChecker+Invalid, 3898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 01:20:48,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10135 Valid, 7056 Invalid, 3898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3897 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 01:20:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-11-10 01:20:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2024-11-10 01:20:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3636 states have (on average 1.4955995599559957) internal successors, (5438), 3636 states have internal predecessors, (5438), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:20:48,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5470 transitions. [2024-11-10 01:20:48,437 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5470 transitions. Word has length 953 [2024-11-10 01:20:48,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:20:48,438 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 5470 transitions. [2024-11-10 01:20:48,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5470 transitions. [2024-11-10 01:20:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2024-11-10 01:20:48,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:20:48,447 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:20:48,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:20:48,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:20:48,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:20:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2100103782, now seen corresponding path program 1 times [2024-11-10 01:20:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:20:48,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640025997] [2024-11-10 01:20:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:20:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:20:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:20:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:20:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:20:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:20:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:20:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:20:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:20:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:20:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:20:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-11-10 01:20:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-11-10 01:20:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-10 01:20:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-10 01:20:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-10 01:20:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2024-11-10 01:20:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-10 01:20:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:20:51,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:20:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640025997] [2024-11-10 01:20:51,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640025997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:20:51,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:20:51,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:20:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499475512] [2024-11-10 01:20:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:20:51,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:20:51,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:20:51,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:20:51,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:20:51,490 INFO L87 Difference]: Start difference. First operand 3654 states and 5470 transitions. Second operand has 5 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:20:54,309 INFO L93 Difference]: Finished difference Result 6566 states and 9828 transitions. [2024-11-10 01:20:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:20:54,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 954 [2024-11-10 01:20:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:20:54,321 INFO L225 Difference]: With dead ends: 6566 [2024-11-10 01:20:54,322 INFO L226 Difference]: Without dead ends: 3654 [2024-11-10 01:20:54,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-10 01:20:54,326 INFO L432 NwaCegarLoop]: 3527 mSDtfsCounter, 9998 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3895 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10007 SdHoareTripleChecker+Valid, 7056 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 01:20:54,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10007 Valid, 7056 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3895 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 01:20:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-11-10 01:20:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2024-11-10 01:20:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3636 states have (on average 1.4953245324532454) internal successors, (5437), 3636 states have internal predecessors, (5437), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:20:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5469 transitions. [2024-11-10 01:20:54,390 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5469 transitions. Word has length 954 [2024-11-10 01:20:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:20:54,391 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 5469 transitions. [2024-11-10 01:20:54,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5469 transitions. [2024-11-10 01:20:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2024-11-10 01:20:54,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:20:54,401 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:20:54,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:20:54,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:20:54,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:20:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1634912644, now seen corresponding path program 1 times [2024-11-10 01:20:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:20:54,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538362021] [2024-11-10 01:20:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:20:54,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:20:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:20:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:20:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:20:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:20:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:20:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:20:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:20:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:20:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:20:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-11-10 01:20:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-11-10 01:20:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-10 01:20:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-10 01:20:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-10 01:20:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2024-11-10 01:20:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-10 01:20:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:20:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:20:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:20:56,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538362021] [2024-11-10 01:20:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538362021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:20:56,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:20:56,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:20:56,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543648646] [2024-11-10 01:20:56,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:20:56,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:20:56,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:20:56,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:20:56,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:20:56,886 INFO L87 Difference]: Start difference. First operand 3654 states and 5469 transitions. Second operand has 5 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:20:59,150 INFO L93 Difference]: Finished difference Result 6566 states and 9826 transitions. [2024-11-10 01:20:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:20:59,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 955 [2024-11-10 01:20:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:20:59,167 INFO L225 Difference]: With dead ends: 6566 [2024-11-10 01:20:59,167 INFO L226 Difference]: Without dead ends: 3654 [2024-11-10 01:20:59,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-10 01:20:59,174 INFO L432 NwaCegarLoop]: 3527 mSDtfsCounter, 5171 mSDsluCounter, 3549 mSDsCounter, 0 mSdLazyCounter, 3893 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5180 SdHoareTripleChecker+Valid, 7076 SdHoareTripleChecker+Invalid, 3894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:20:59,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5180 Valid, 7076 Invalid, 3894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3893 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 01:20:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-11-10 01:20:59,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2024-11-10 01:20:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3636 states have (on average 1.495049504950495) internal successors, (5436), 3636 states have internal predecessors, (5436), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:20:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5468 transitions. [2024-11-10 01:20:59,217 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5468 transitions. Word has length 955 [2024-11-10 01:20:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:20:59,218 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 5468 transitions. [2024-11-10 01:20:59,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:20:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5468 transitions. [2024-11-10 01:20:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2024-11-10 01:20:59,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:20:59,226 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:20:59,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 01:20:59,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:20:59,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:20:59,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1478919125, now seen corresponding path program 1 times [2024-11-10 01:20:59,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:20:59,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835043597] [2024-11-10 01:20:59,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:20:59,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:20:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:21:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:21:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:21:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:21:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:21:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:21:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:21:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:21:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:21:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-11-10 01:21:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-11-10 01:21:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-10 01:21:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-10 01:21:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-10 01:21:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2024-11-10 01:21:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-10 01:21:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:21:01,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:21:01,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835043597] [2024-11-10 01:21:01,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835043597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:21:01,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:21:01,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:21:01,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120131591] [2024-11-10 01:21:01,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:21:01,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:21:01,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:21:01,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:21:01,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:21:01,123 INFO L87 Difference]: Start difference. First operand 3654 states and 5468 transitions. Second operand has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:21:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:21:03,432 INFO L93 Difference]: Finished difference Result 6566 states and 9824 transitions. [2024-11-10 01:21:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:21:03,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 956 [2024-11-10 01:21:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:21:03,459 INFO L225 Difference]: With dead ends: 6566 [2024-11-10 01:21:03,459 INFO L226 Difference]: Without dead ends: 3654 [2024-11-10 01:21:03,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-11-10 01:21:03,472 INFO L432 NwaCegarLoop]: 3527 mSDtfsCounter, 5107 mSDsluCounter, 3549 mSDsCounter, 0 mSdLazyCounter, 3891 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 7076 SdHoareTripleChecker+Invalid, 3892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 01:21:03,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 7076 Invalid, 3892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3891 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 01:21:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2024-11-10 01:21:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2024-11-10 01:21:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 3636 states have (on average 1.4947744774477447) internal successors, (5435), 3636 states have internal predecessors, (5435), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 01:21:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5467 transitions. [2024-11-10 01:21:03,614 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5467 transitions. Word has length 956 [2024-11-10 01:21:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:21:03,615 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 5467 transitions. [2024-11-10 01:21:03,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 01:21:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5467 transitions. [2024-11-10 01:21:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 958 [2024-11-10 01:21:03,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:21:03,637 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:21:03,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 01:21:03,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:21:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:21:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -668084703, now seen corresponding path program 1 times [2024-11-10 01:21:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:21:03,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956382574] [2024-11-10 01:21:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:21:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:21:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-11-10 01:21:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 399 [2024-11-10 01:21:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 413 [2024-11-10 01:21:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2024-11-10 01:21:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 441 [2024-11-10 01:21:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2024-11-10 01:21:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2024-11-10 01:21:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 493 [2024-11-10 01:21:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 511 [2024-11-10 01:21:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 530 [2024-11-10 01:21:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 540 [2024-11-10 01:21:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 552 [2024-11-10 01:21:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 564 [2024-11-10 01:21:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 576 [2024-11-10 01:21:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 588 [2024-11-10 01:21:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 600 [2024-11-10 01:21:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:21:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 01:21:06,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:21:06,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956382574] [2024-11-10 01:21:06,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956382574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:21:06,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:21:06,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:21:06,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433150536] [2024-11-10 01:21:06,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:21:06,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:21:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:21:06,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:21:06,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:21:06,179 INFO L87 Difference]: Start difference. First operand 3654 states and 5467 transitions. Second operand has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)