./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w16_d64_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_n3_w16_d64_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 da1efcc99a36ff96b3db7c5f7bd7f377a45db0a03ab53d208bdaa6b6c61e8dc9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:16:36,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:16:36,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:16:36,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:16:36,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:16:36,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:16:36,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:16:36,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:16:36,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:16:36,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:16:36,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:16:36,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:16:36,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:16:36,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:16:36,350 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:16:36,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:16:36,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:16:36,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:16:36,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:16:36,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:16:36,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:16:36,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:16:36,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:16:36,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:16:36,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:16:36,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:16:36,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:16:36,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:16:36,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:16:36,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:16:36,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:16:36,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:16:36,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:16:36,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:16:36,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:16:36,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:16:36,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:16:36,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:16:36,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:16:36,361 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 -> da1efcc99a36ff96b3db7c5f7bd7f377a45db0a03ab53d208bdaa6b6c61e8dc9 [2024-11-10 01:16:36,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:16:36,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:16:36,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:16:36,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:16:36,671 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:16:36,673 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_n3_w16_d64_e0.c [2024-11-10 01:16:38,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:16:38,659 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:16:38,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n3_w16_d64_e0.c [2024-11-10 01:16:38,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398247ef1/b937d6a4695e44069bd14c83f9f1aab7/FLAGb5b371922 [2024-11-10 01:16:38,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398247ef1/b937d6a4695e44069bd14c83f9f1aab7 [2024-11-10 01:16:38,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:16:38,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:16:38,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:16:38,782 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:16:38,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:16:38,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:16:38" (1/1) ... [2024-11-10 01:16:38,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dc9ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:38, skipping insertion in model container [2024-11-10 01:16:38,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:16:38" (1/1) ... [2024-11-10 01:16:38,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:16:39,231 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_n3_w16_d64_e0.c[1271,1284] [2024-11-10 01:16:40,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:16:40,235 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:16:40,246 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_n3_w16_d64_e0.c[1271,1284] [2024-11-10 01:16:40,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:16:40,761 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:16:40,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40 WrapperNode [2024-11-10 01:16:40,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:16:40,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:16:40,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:16:40,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:16:40,772 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:16:40" (1/1) ... [2024-11-10 01:16:40,926 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:16:40" (1/1) ... [2024-11-10 01:16:43,369 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 14673 [2024-11-10 01:16:43,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:16:43,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:16:43,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:16:43,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:16:43,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:43,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:43,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:44,192 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:16:44,192 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:44,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:44,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:44,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:44,848 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:44,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:45,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:16:45,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:16:45,208 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:16:45,208 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:16:45,209 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (1/1) ... [2024-11-10 01:16:45,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:16:45,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:16:45,248 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:16:45,251 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:16:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:16:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 01:16:45,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 01:16:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:16:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:16:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:16:46,374 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:16:46,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:17:13,357 INFO L? ?]: Removed 8534 outVars from TransFormulas that were not future-live. [2024-11-10 01:17:13,357 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:17:13,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:17:13,717 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:17:13,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:17:13 BoogieIcfgContainer [2024-11-10 01:17:13,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:17:13,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:17:13,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:17:13,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:17:13,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:16:38" (1/3) ... [2024-11-10 01:17:13,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4757445b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:17:13, skipping insertion in model container [2024-11-10 01:17:13,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:16:40" (2/3) ... [2024-11-10 01:17:13,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4757445b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:17:13, skipping insertion in model container [2024-11-10 01:17:13,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:17:13" (3/3) ... [2024-11-10 01:17:13,726 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n3_w16_d64_e0.c [2024-11-10 01:17:13,742 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:17:13,742 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:17:13,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:17:13,872 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;@5ad96d14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:17:13,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:17:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 3981 states, 3968 states have (on average 1.497983870967742) internal successors, (5944), 3969 states have internal predecessors, (5944), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 01:17:13,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2024-11-10 01:17:13,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:17:13,951 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:13,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:17:13,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:17:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2089436285, now seen corresponding path program 1 times [2024-11-10 01:17:13,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:17:13,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163210289] [2024-11-10 01:17:13,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:17:13,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:17:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-10 01:17:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-10 01:17:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-10 01:17:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-10 01:17:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-11-10 01:17:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-11-10 01:17:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-11-10 01:17:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2024-11-10 01:17:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-10 01:17:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2024-11-10 01:17:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 01:17:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:17:15,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163210289] [2024-11-10 01:17:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163210289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:17:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:17:15,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 01:17:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013944295] [2024-11-10 01:17:15,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:17:15,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 01:17:15,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:17:15,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 01:17:15,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 01:17:15,826 INFO L87 Difference]: Start difference. First operand has 3981 states, 3968 states have (on average 1.497983870967742) internal successors, (5944), 3969 states have internal predecessors, (5944), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 463.5) internal successors, (927), 2 states have internal predecessors, (927), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 01:17:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:17:17,083 INFO L93 Difference]: Finished difference Result 7119 states and 10678 transitions. [2024-11-10 01:17:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 01:17:17,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 463.5) internal successors, (927), 2 states have internal predecessors, (927), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 974 [2024-11-10 01:17:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:17:17,129 INFO L225 Difference]: With dead ends: 7119 [2024-11-10 01:17:17,129 INFO L226 Difference]: Without dead ends: 3976 [2024-11-10 01:17:17,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:17:17,147 INFO L432 NwaCegarLoop]: 4971 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4971 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:17:17,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4971 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 01:17:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3976 states. [2024-11-10 01:17:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 3976. [2024-11-10 01:17:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3976 states, 3964 states have (on average 1.4977295660948537) internal successors, (5937), 3964 states have internal predecessors, (5937), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 01:17:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3976 states to 3976 states and 5957 transitions. [2024-11-10 01:17:17,333 INFO L78 Accepts]: Start accepts. Automaton has 3976 states and 5957 transitions. Word has length 974 [2024-11-10 01:17:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:17:17,335 INFO L471 AbstractCegarLoop]: Abstraction has 3976 states and 5957 transitions. [2024-11-10 01:17:17,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 463.5) internal successors, (927), 2 states have internal predecessors, (927), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 01:17:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3976 states and 5957 transitions. [2024-11-10 01:17:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2024-11-10 01:17:17,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:17:17,367 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:17,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:17:17,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:17:17,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:17:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 584578573, now seen corresponding path program 1 times [2024-11-10 01:17:17,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:17:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299648612] [2024-11-10 01:17:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:17:17,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:17:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-10 01:17:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-10 01:17:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-10 01:17:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-10 01:17:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-11-10 01:17:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-11-10 01:17:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-11-10 01:17:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2024-11-10 01:17:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-10 01:17:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2024-11-10 01:17:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 01:17:23,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:17:23,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299648612] [2024-11-10 01:17:23,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299648612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:17:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:17:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:17:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952427269] [2024-11-10 01:17:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:17:23,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:17:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:17:23,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:17:23,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:17:23,891 INFO L87 Difference]: Start difference. First operand 3976 states and 5957 transitions. Second operand has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 01:17:26,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:17:26,010 INFO L93 Difference]: Finished difference Result 3981 states and 5962 transitions. [2024-11-10 01:17:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:17:26,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 974 [2024-11-10 01:17:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:17:26,033 INFO L225 Difference]: With dead ends: 3981 [2024-11-10 01:17:26,033 INFO L226 Difference]: Without dead ends: 3978 [2024-11-10 01:17:26,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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:17:26,040 INFO L432 NwaCegarLoop]: 4969 mSDtfsCounter, 0 mSDsluCounter, 9933 mSDsCounter, 0 mSdLazyCounter, 2968 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14902 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 01:17:26,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14902 Invalid, 2968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 2968 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 01:17:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2024-11-10 01:17:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3978. [2024-11-10 01:17:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3966 states have (on average 1.4974785678265254) internal successors, (5939), 3966 states have internal predecessors, (5939), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 01:17:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5959 transitions. [2024-11-10 01:17:26,155 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5959 transitions. Word has length 974 [2024-11-10 01:17:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:17:26,161 INFO L471 AbstractCegarLoop]: Abstraction has 3978 states and 5959 transitions. [2024-11-10 01:17:26,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-10 01:17:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5959 transitions. [2024-11-10 01:17:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2024-11-10 01:17:26,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:17:26,179 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:26,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:17:26,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:17:26,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:17:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1087123680, now seen corresponding path program 1 times [2024-11-10 01:17:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:17:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240168670] [2024-11-10 01:17:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:17:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:17:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-10 01:17:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-10 01:17:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-10 01:17:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-10 01:17:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 497 [2024-11-10 01:17:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 513 [2024-11-10 01:17:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 523 [2024-11-10 01:17:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 535 [2024-11-10 01:17:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 547 [2024-11-10 01:17:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 559 [2024-11-10 01:17:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 01:17:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:17:29,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240168670] [2024-11-10 01:17:29,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240168670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:17:29,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:17:29,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:17:29,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209121755] [2024-11-10 01:17:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:17:29,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:17:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:17:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:17:29,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:17:29,859 INFO L87 Difference]: Start difference. First operand 3978 states and 5959 transitions. Second operand has 5 states, 5 states have (on average 185.6) internal successors, (928), 5 states have internal predecessors, (928), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 01:17:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:17:33,947 INFO L93 Difference]: Finished difference Result 9749 states and 14607 transitions. [2024-11-10 01:17:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:17:33,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 185.6) internal successors, (928), 5 states have internal predecessors, (928), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 975 [2024-11-10 01:17:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:17:33,966 INFO L225 Difference]: With dead ends: 9749 [2024-11-10 01:17:33,966 INFO L226 Difference]: Without dead ends: 3978 [2024-11-10 01:17:33,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 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:17:33,978 INFO L432 NwaCegarLoop]: 4790 mSDtfsCounter, 12267 mSDsluCounter, 8750 mSDsCounter, 0 mSdLazyCounter, 4572 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12273 SdHoareTripleChecker+Valid, 13540 SdHoareTripleChecker+Invalid, 4830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 4572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-10 01:17:33,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12273 Valid, 13540 Invalid, 4830 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [258 Valid, 4572 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-10 01:17:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2024-11-10 01:17:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3978. [2024-11-10 01:17:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3966 states have (on average 1.497226424609178) internal successors, (5938), 3966 states have internal predecessors, (5938), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 01:17:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5958 transitions. [2024-11-10 01:17:34,074 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5958 transitions. Word has length 975 [2024-11-10 01:17:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:17:34,078 INFO L471 AbstractCegarLoop]: Abstraction has 3978 states and 5958 transitions. [2024-11-10 01:17:34,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 185.6) internal successors, (928), 5 states have internal predecessors, (928), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 01:17:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5958 transitions. [2024-11-10 01:17:34,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2024-11-10 01:17:34,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:17:34,090 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:34,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:17:34,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:17:34,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:17:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash -420186385, now seen corresponding path program 1 times [2024-11-10 01:17:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:17:34,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339978322] [2024-11-10 01:17:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:17:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:17:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-10 01:17:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-10 01:17:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-10 01:17:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-10 01:17:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2024-11-10 01:17:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-10 01:17:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2024-11-10 01:17:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2024-11-10 01:17:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2024-11-10 01:17:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-11-10 01:17:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 01:17:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:17:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339978322] [2024-11-10 01:17:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339978322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:17:36,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:17:36,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:17:36,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871577822] [2024-11-10 01:17:36,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:17:36,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:17:36,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:17:36,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:17:36,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:17:36,929 INFO L87 Difference]: Start difference. First operand 3978 states and 5958 transitions. Second operand has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 01:17:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:17:39,600 INFO L93 Difference]: Finished difference Result 7118 states and 10660 transitions. [2024-11-10 01:17:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:17:39,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 976 [2024-11-10 01:17:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:17:39,618 INFO L225 Difference]: With dead ends: 7118 [2024-11-10 01:17:39,619 INFO L226 Difference]: Without dead ends: 3978 [2024-11-10 01:17:39,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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:17:39,626 INFO L432 NwaCegarLoop]: 3939 mSDtfsCounter, 11263 mSDsluCounter, 3941 mSDsCounter, 0 mSdLazyCounter, 4041 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11267 SdHoareTripleChecker+Valid, 7880 SdHoareTripleChecker+Invalid, 4042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 01:17:39,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11267 Valid, 7880 Invalid, 4042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4041 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 01:17:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3978 states. [2024-11-10 01:17:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3978 to 3978. [2024-11-10 01:17:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3966 states have (on average 1.4969742813918305) internal successors, (5937), 3966 states have internal predecessors, (5937), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 01:17:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5957 transitions. [2024-11-10 01:17:39,725 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5957 transitions. Word has length 976 [2024-11-10 01:17:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:17:39,726 INFO L471 AbstractCegarLoop]: Abstraction has 3978 states and 5957 transitions. [2024-11-10 01:17:39,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-10 01:17:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5957 transitions. [2024-11-10 01:17:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2024-11-10 01:17:39,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:17:39,739 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:39,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:17:39,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:17:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:17:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -451328157, now seen corresponding path program 1 times [2024-11-10 01:17:39,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:17:39,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591854603] [2024-11-10 01:17:39,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:17:39,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:17:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 433 [2024-11-10 01:17:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 447 [2024-11-10 01:17:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 461 [2024-11-10 01:17:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 479 [2024-11-10 01:17:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2024-11-10 01:17:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2024-11-10 01:17:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 524 [2024-11-10 01:17:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2024-11-10 01:17:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 548 [2024-11-10 01:17:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-11-10 01:17:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:17:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-10 01:17:42,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:17:42,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591854603] [2024-11-10 01:17:42,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591854603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:17:42,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:17:42,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 01:17:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990543766] [2024-11-10 01:17:42,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:17:42,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 01:17:42,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:17:42,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 01:17:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 01:17:42,474 INFO L87 Difference]: Start difference. First operand 3978 states and 5957 transitions. Second operand has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)