./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:22:56,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:22:56,678 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:22:56,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:22:56,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:22:56,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:22:56,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:22:56,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:22:56,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:22:56,724 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:22:56,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:22:56,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:22:56,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:22:56,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:22:56,729 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:22:56,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:22:56,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:22:56,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:22:56,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:22:56,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:22:56,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:22:56,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:22:56,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:22:56,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:22:56,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:22:56,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:22:56,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:22:56,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:22:56,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:22:56,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:22:56,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:22:56,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:22:56,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:22:56,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:22:56,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:22:56,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:22:56,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:22:56,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:22:56,739 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:22:56,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:22:56,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:22:56,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:22:56,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2 [2024-10-14 03:22:56,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:22:57,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:22:57,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:22:57,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:22:57,005 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:22:57,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2024-10-14 03:22:58,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:22:58,749 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:22:58,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2024-10-14 03:22:58,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8617ad3/b631df06633d433ca35c4c44b589fbf2/FLAGc9130c63d [2024-10-14 03:22:59,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac8617ad3/b631df06633d433ca35c4c44b589fbf2 [2024-10-14 03:22:59,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:22:59,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:22:59,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:22:59,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:22:59,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:22:59,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@226bf734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59, skipping insertion in model container [2024-10-14 03:22:59,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:22:59,317 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c[671,684] [2024-10-14 03:22:59,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:22:59,416 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:22:59,427 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c[671,684] [2024-10-14 03:22:59,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:22:59,493 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:22:59,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59 WrapperNode [2024-10-14 03:22:59,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:22:59,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:22:59,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:22:59,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:22:59,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,566 INFO L138 Inliner]: procedures = 38, calls = 46, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 459 [2024-10-14 03:22:59,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:22:59,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:22:59,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:22:59,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:22:59,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,620 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:22:59,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:22:59,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:22:59,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:22:59,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:22:59,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (1/1) ... [2024-10-14 03:22:59,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:22:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:22:59,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:22:59,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:22:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:22:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:22:59,748 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:22:59,748 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:22:59,748 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:22:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:22:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:22:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:22:59,749 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:22:59,749 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:22:59,750 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:22:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:22:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:22:59,750 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:22:59,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:22:59,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:22:59,832 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:22:59,837 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:23:00,388 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-14 03:23:00,389 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:23:00,444 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:23:00,444 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-14 03:23:00,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:00 BoogieIcfgContainer [2024-10-14 03:23:00,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:23:00,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:23:00,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:23:00,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:23:00,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:22:59" (1/3) ... [2024-10-14 03:23:00,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428d8bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:00, skipping insertion in model container [2024-10-14 03:23:00,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:22:59" (2/3) ... [2024-10-14 03:23:00,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428d8bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:00, skipping insertion in model container [2024-10-14 03:23:00,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:00" (3/3) ... [2024-10-14 03:23:00,452 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-1.c [2024-10-14 03:23:00,464 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:23:00,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:23:00,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:23:00,638 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;@6644a392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:23:00,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:23:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 160 states have (on average 1.7) internal successors, (272), 162 states have internal predecessors, (272), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 03:23:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:00,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:00,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:00,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:00,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1621549095, now seen corresponding path program 1 times [2024-10-14 03:23:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607514973] [2024-10-14 03:23:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:01,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:01,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:01,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:01,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607514973] [2024-10-14 03:23:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607514973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:01,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:01,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:23:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162922507] [2024-10-14 03:23:01,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:01,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:23:01,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:01,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:23:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:23:01,335 INFO L87 Difference]: Start difference. First operand has 187 states, 160 states have (on average 1.7) internal successors, (272), 162 states have internal predecessors, (272), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:02,976 INFO L93 Difference]: Finished difference Result 664 states and 1116 transitions. [2024-10-14 03:23:02,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:23:02,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:02,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:02,999 INFO L225 Difference]: With dead ends: 664 [2024-10-14 03:23:03,000 INFO L226 Difference]: Without dead ends: 484 [2024-10-14 03:23:03,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:03,013 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 717 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:03,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 573 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:23:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-14 03:23:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 365. [2024-10-14 03:23:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 318 states have (on average 1.5974842767295598) internal successors, (508), 320 states have internal predecessors, (508), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-10-14 03:23:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 577 transitions. [2024-10-14 03:23:03,140 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 577 transitions. Word has length 90 [2024-10-14 03:23:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:03,141 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 577 transitions. [2024-10-14 03:23:03,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 577 transitions. [2024-10-14 03:23:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:03,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:03,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:03,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:23:03,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:03,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -208280099, now seen corresponding path program 1 times [2024-10-14 03:23:03,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:03,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567389681] [2024-10-14 03:23:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:03,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:03,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:03,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:03,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:03,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567389681] [2024-10-14 03:23:03,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567389681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:03,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:03,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:03,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839513995] [2024-10-14 03:23:03,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:03,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:03,457 INFO L87 Difference]: Start difference. First operand 365 states and 577 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:05,362 INFO L93 Difference]: Finished difference Result 1083 states and 1737 transitions. [2024-10-14 03:23:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:05,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:05,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:05,370 INFO L225 Difference]: With dead ends: 1083 [2024-10-14 03:23:05,371 INFO L226 Difference]: Without dead ends: 729 [2024-10-14 03:23:05,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:05,377 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 722 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:05,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1055 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:23:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-14 03:23:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 532. [2024-10-14 03:23:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 464 states have (on average 1.5883620689655173) internal successors, (737), 467 states have internal predecessors, (737), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-10-14 03:23:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 836 transitions. [2024-10-14 03:23:05,460 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 836 transitions. Word has length 90 [2024-10-14 03:23:05,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:05,461 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 836 transitions. [2024-10-14 03:23:05,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 836 transitions. [2024-10-14 03:23:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:05,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:05,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:05,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:23:05,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:05,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2009350299, now seen corresponding path program 1 times [2024-10-14 03:23:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721603267] [2024-10-14 03:23:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:05,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:05,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:05,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:05,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:05,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721603267] [2024-10-14 03:23:05,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721603267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:05,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:05,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:05,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730788174] [2024-10-14 03:23:05,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:05,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:05,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:05,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:05,690 INFO L87 Difference]: Start difference. First operand 532 states and 836 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:07,382 INFO L93 Difference]: Finished difference Result 1705 states and 2726 transitions. [2024-10-14 03:23:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:07,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:07,393 INFO L225 Difference]: With dead ends: 1705 [2024-10-14 03:23:07,393 INFO L226 Difference]: Without dead ends: 1184 [2024-10-14 03:23:07,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:07,397 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 720 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:07,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1053 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:23:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-10-14 03:23:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 867. [2024-10-14 03:23:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 757 states have (on average 1.5799207397622193) internal successors, (1196), 762 states have internal predecessors, (1196), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-10-14 03:23:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1359 transitions. [2024-10-14 03:23:07,475 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1359 transitions. Word has length 90 [2024-10-14 03:23:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:07,477 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1359 transitions. [2024-10-14 03:23:07,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1359 transitions. [2024-10-14 03:23:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:07,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:07,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:07,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:23:07,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:07,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash -551512547, now seen corresponding path program 1 times [2024-10-14 03:23:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075810608] [2024-10-14 03:23:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:07,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:07,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:07,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:07,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:07,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075810608] [2024-10-14 03:23:07,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075810608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:07,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:07,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:07,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112135145] [2024-10-14 03:23:07,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:07,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:07,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:07,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:07,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:07,704 INFO L87 Difference]: Start difference. First operand 867 states and 1359 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:08,633 INFO L93 Difference]: Finished difference Result 2030 states and 3242 transitions. [2024-10-14 03:23:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:08,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:08,642 INFO L225 Difference]: With dead ends: 2030 [2024-10-14 03:23:08,643 INFO L226 Difference]: Without dead ends: 1174 [2024-10-14 03:23:08,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:08,650 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 533 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:08,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 535 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:23:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-10-14 03:23:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 867. [2024-10-14 03:23:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 757 states have (on average 1.57331571994716) internal successors, (1191), 762 states have internal predecessors, (1191), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-10-14 03:23:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1354 transitions. [2024-10-14 03:23:08,746 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1354 transitions. Word has length 90 [2024-10-14 03:23:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1354 transitions. [2024-10-14 03:23:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1354 transitions. [2024-10-14 03:23:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:08,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:08,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:08,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:23:08,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash 335710299, now seen corresponding path program 1 times [2024-10-14 03:23:08,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:08,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624102258] [2024-10-14 03:23:08,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:08,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:08,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:08,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624102258] [2024-10-14 03:23:08,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624102258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:08,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:08,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538209522] [2024-10-14 03:23:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:08,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:08,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:08,961 INFO L87 Difference]: Start difference. First operand 867 states and 1354 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:09,874 INFO L93 Difference]: Finished difference Result 2024 states and 3216 transitions. [2024-10-14 03:23:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:09,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:09,881 INFO L225 Difference]: With dead ends: 2024 [2024-10-14 03:23:09,881 INFO L226 Difference]: Without dead ends: 1168 [2024-10-14 03:23:09,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:09,884 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 536 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:09,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 535 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:23:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-10-14 03:23:09,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 867. [2024-10-14 03:23:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 757 states have (on average 1.5667107001321003) internal successors, (1186), 762 states have internal predecessors, (1186), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-10-14 03:23:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1349 transitions. [2024-10-14 03:23:09,939 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1349 transitions. Word has length 90 [2024-10-14 03:23:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:09,940 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1349 transitions. [2024-10-14 03:23:09,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1349 transitions. [2024-10-14 03:23:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:09,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:09,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:09,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:23:09,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:09,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1575332259, now seen corresponding path program 1 times [2024-10-14 03:23:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:09,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815118829] [2024-10-14 03:23:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:09,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:10,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815118829] [2024-10-14 03:23:10,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815118829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:10,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:10,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263104196] [2024-10-14 03:23:10,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:10,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:10,097 INFO L87 Difference]: Start difference. First operand 867 states and 1349 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:11,752 INFO L93 Difference]: Finished difference Result 3153 states and 4971 transitions. [2024-10-14 03:23:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:11,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:11,765 INFO L225 Difference]: With dead ends: 3153 [2024-10-14 03:23:11,766 INFO L226 Difference]: Without dead ends: 2297 [2024-10-14 03:23:11,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:11,771 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 948 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:11,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 702 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:23:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-10-14 03:23:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1543. [2024-10-14 03:23:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 1353 states have (on average 1.5609756097560976) internal successors, (2112), 1362 states have internal predecessors, (2112), 127 states have call successors, (127), 54 states have call predecessors, (127), 62 states have return successors, (162), 134 states have call predecessors, (162), 127 states have call successors, (162) [2024-10-14 03:23:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2401 transitions. [2024-10-14 03:23:11,893 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2401 transitions. Word has length 90 [2024-10-14 03:23:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:11,893 INFO L471 AbstractCegarLoop]: Abstraction has 1543 states and 2401 transitions. [2024-10-14 03:23:11,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2401 transitions. [2024-10-14 03:23:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:11,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:11,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:11,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:23:11,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:11,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1752284383, now seen corresponding path program 1 times [2024-10-14 03:23:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659198948] [2024-10-14 03:23:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:12,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:12,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659198948] [2024-10-14 03:23:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659198948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:12,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:12,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971621879] [2024-10-14 03:23:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:12,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:12,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:12,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:12,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:12,095 INFO L87 Difference]: Start difference. First operand 1543 states and 2401 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:13,840 INFO L93 Difference]: Finished difference Result 5703 states and 8985 transitions. [2024-10-14 03:23:13,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:13,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:13,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:13,863 INFO L225 Difference]: With dead ends: 5703 [2024-10-14 03:23:13,863 INFO L226 Difference]: Without dead ends: 4171 [2024-10-14 03:23:13,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:13,895 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 742 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:13,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1042 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:23:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2024-10-14 03:23:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 2848. [2024-10-14 03:23:14,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2502 states have (on average 1.5563549160671464) internal successors, (3894), 2519 states have internal predecessors, (3894), 227 states have call successors, (227), 102 states have call predecessors, (227), 118 states have return successors, (324), 242 states have call predecessors, (324), 227 states have call successors, (324) [2024-10-14 03:23:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 4445 transitions. [2024-10-14 03:23:14,093 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 4445 transitions. Word has length 90 [2024-10-14 03:23:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:14,093 INFO L471 AbstractCegarLoop]: Abstraction has 2848 states and 4445 transitions. [2024-10-14 03:23:14,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4445 transitions. [2024-10-14 03:23:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:14,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:14,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:14,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:23:14,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:14,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash -634225123, now seen corresponding path program 1 times [2024-10-14 03:23:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:14,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524937955] [2024-10-14 03:23:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:14,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:14,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524937955] [2024-10-14 03:23:14,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524937955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:14,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:14,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876366633] [2024-10-14 03:23:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:14,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:14,258 INFO L87 Difference]: Start difference. First operand 2848 states and 4445 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:14,991 INFO L93 Difference]: Finished difference Result 6506 states and 10298 transitions. [2024-10-14 03:23:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:14,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:15,015 INFO L225 Difference]: With dead ends: 6506 [2024-10-14 03:23:15,015 INFO L226 Difference]: Without dead ends: 3669 [2024-10-14 03:23:15,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:15,027 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 608 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:15,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 447 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:23:15,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2024-10-14 03:23:15,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 2848. [2024-10-14 03:23:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2502 states have (on average 1.5495603517186252) internal successors, (3877), 2519 states have internal predecessors, (3877), 227 states have call successors, (227), 102 states have call predecessors, (227), 118 states have return successors, (324), 242 states have call predecessors, (324), 227 states have call successors, (324) [2024-10-14 03:23:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 4428 transitions. [2024-10-14 03:23:15,245 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 4428 transitions. Word has length 90 [2024-10-14 03:23:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:15,245 INFO L471 AbstractCegarLoop]: Abstraction has 2848 states and 4428 transitions. [2024-10-14 03:23:15,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4428 transitions. [2024-10-14 03:23:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:15,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:15,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:15,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:23:15,252 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:15,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1126851297, now seen corresponding path program 1 times [2024-10-14 03:23:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495473269] [2024-10-14 03:23:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:15,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:15,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:15,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495473269] [2024-10-14 03:23:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495473269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080331575] [2024-10-14 03:23:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:15,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:15,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:15,421 INFO L87 Difference]: Start difference. First operand 2848 states and 4428 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:17,230 INFO L93 Difference]: Finished difference Result 10356 states and 16267 transitions. [2024-10-14 03:23:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:17,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:17,272 INFO L225 Difference]: With dead ends: 10356 [2024-10-14 03:23:17,272 INFO L226 Difference]: Without dead ends: 7519 [2024-10-14 03:23:17,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:17,284 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 781 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:17,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1046 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:23:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7519 states. [2024-10-14 03:23:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7519 to 5514. [2024-10-14 03:23:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5514 states, 4864 states have (on average 1.5462582236842106) internal successors, (7521), 4897 states have internal predecessors, (7521), 419 states have call successors, (419), 198 states have call predecessors, (419), 230 states have return successors, (694), 450 states have call predecessors, (694), 419 states have call successors, (694) [2024-10-14 03:23:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 8634 transitions. [2024-10-14 03:23:17,792 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 8634 transitions. Word has length 90 [2024-10-14 03:23:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 5514 states and 8634 transitions. [2024-10-14 03:23:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 8634 transitions. [2024-10-14 03:23:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:17,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:17,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:17,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:23:17,800 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:17,800 INFO L85 PathProgramCache]: Analyzing trace with hash -172911139, now seen corresponding path program 1 times [2024-10-14 03:23:17,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:17,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681283534] [2024-10-14 03:23:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681283534] [2024-10-14 03:23:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681283534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:17,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:17,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:17,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414175452] [2024-10-14 03:23:17,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:17,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:17,971 INFO L87 Difference]: Start difference. First operand 5514 states and 8634 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:20,224 INFO L93 Difference]: Finished difference Result 19756 states and 31243 transitions. [2024-10-14 03:23:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:20,295 INFO L225 Difference]: With dead ends: 19756 [2024-10-14 03:23:20,295 INFO L226 Difference]: Without dead ends: 14253 [2024-10-14 03:23:20,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:20,321 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 707 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:20,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1046 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:23:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14253 states. [2024-10-14 03:23:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14253 to 10843. [2024-10-14 03:23:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10843 states, 9601 states have (on average 1.5451515467138839) internal successors, (14835), 9666 states have internal predecessors, (14835), 787 states have call successors, (787), 390 states have call predecessors, (787), 454 states have return successors, (1580), 850 states have call predecessors, (1580), 787 states have call successors, (1580) [2024-10-14 03:23:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10843 states to 10843 states and 17202 transitions. [2024-10-14 03:23:21,212 INFO L78 Accepts]: Start accepts. Automaton has 10843 states and 17202 transitions. Word has length 90 [2024-10-14 03:23:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:21,213 INFO L471 AbstractCegarLoop]: Abstraction has 10843 states and 17202 transitions. [2024-10-14 03:23:21,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 10843 states and 17202 transitions. [2024-10-14 03:23:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:21,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:21,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:21,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:23:21,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:21,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:21,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1389064865, now seen corresponding path program 1 times [2024-10-14 03:23:21,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:21,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559076706] [2024-10-14 03:23:21,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:21,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:21,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:21,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:21,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:21,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:21,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559076706] [2024-10-14 03:23:21,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559076706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:21,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:21,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:21,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204349963] [2024-10-14 03:23:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:21,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:21,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:21,364 INFO L87 Difference]: Start difference. First operand 10843 states and 17202 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:22,751 INFO L93 Difference]: Finished difference Result 24330 states and 39231 transitions. [2024-10-14 03:23:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:22,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:22,861 INFO L225 Difference]: With dead ends: 24330 [2024-10-14 03:23:22,862 INFO L226 Difference]: Without dead ends: 13498 [2024-10-14 03:23:22,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:22,897 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 530 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:22,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 534 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:23:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13498 states. [2024-10-14 03:23:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13498 to 10843. [2024-10-14 03:23:23,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10843 states, 9601 states have (on average 1.5383814186022289) internal successors, (14770), 9666 states have internal predecessors, (14770), 787 states have call successors, (787), 390 states have call predecessors, (787), 454 states have return successors, (1580), 850 states have call predecessors, (1580), 787 states have call successors, (1580) [2024-10-14 03:23:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10843 states to 10843 states and 17137 transitions. [2024-10-14 03:23:23,983 INFO L78 Accepts]: Start accepts. Automaton has 10843 states and 17137 transitions. Word has length 90 [2024-10-14 03:23:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:23,983 INFO L471 AbstractCegarLoop]: Abstraction has 10843 states and 17137 transitions. [2024-10-14 03:23:23,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 10843 states and 17137 transitions. [2024-10-14 03:23:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:23:23,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:23,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:23,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:23:23,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:23,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2121032291, now seen corresponding path program 1 times [2024-10-14 03:23:23,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027167637] [2024-10-14 03:23:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:24,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027167637] [2024-10-14 03:23:24,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027167637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:24,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:24,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:23:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574939609] [2024-10-14 03:23:24,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:24,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:23:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:24,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:23:24,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:23:24,115 INFO L87 Difference]: Start difference. First operand 10843 states and 17137 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:26,550 INFO L93 Difference]: Finished difference Result 30952 states and 48955 transitions. [2024-10-14 03:23:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:23:26,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2024-10-14 03:23:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:26,626 INFO L225 Difference]: With dead ends: 30952 [2024-10-14 03:23:26,626 INFO L226 Difference]: Without dead ends: 20121 [2024-10-14 03:23:26,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:23:26,664 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 913 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:26,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 805 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:23:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20121 states. [2024-10-14 03:23:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20121 to 16258. [2024-10-14 03:23:27,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16258 states, 14371 states have (on average 1.528703639273537) internal successors, (21969), 14501 states have internal predecessors, (21969), 1202 states have call successors, (1202), 588 states have call predecessors, (1202), 684 states have return successors, (2239), 1232 states have call predecessors, (2239), 1202 states have call successors, (2239) [2024-10-14 03:23:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16258 states to 16258 states and 25410 transitions. [2024-10-14 03:23:28,065 INFO L78 Accepts]: Start accepts. Automaton has 16258 states and 25410 transitions. Word has length 90 [2024-10-14 03:23:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:28,067 INFO L471 AbstractCegarLoop]: Abstraction has 16258 states and 25410 transitions. [2024-10-14 03:23:28,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 16258 states and 25410 transitions. [2024-10-14 03:23:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 03:23:28,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:28,111 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:28,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:23:28,112 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:28,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash -630087554, now seen corresponding path program 1 times [2024-10-14 03:23:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:28,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889899580] [2024-10-14 03:23:28,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:23:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:23:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 03:23:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:23:28,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:28,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889899580] [2024-10-14 03:23:28,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889899580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:23:28,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683083527] [2024-10-14 03:23:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:28,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:23:28,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:23:28,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:23:28,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:23:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:28,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:23:28,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:23:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 03:23:28,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:23:28,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683083527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:28,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:23:28,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 03:23:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961941039] [2024-10-14 03:23:28,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:28,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:23:28,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:28,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:23:28,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:28,567 INFO L87 Difference]: Start difference. First operand 16258 states and 25410 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:23:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:30,960 INFO L93 Difference]: Finished difference Result 48453 states and 76240 transitions. [2024-10-14 03:23:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:23:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 146 [2024-10-14 03:23:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:31,121 INFO L225 Difference]: With dead ends: 48453 [2024-10-14 03:23:31,121 INFO L226 Difference]: Without dead ends: 32207 [2024-10-14 03:23:31,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:31,184 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 239 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:31,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 499 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:23:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32207 states. [2024-10-14 03:23:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32207 to 32107. [2024-10-14 03:23:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32107 states, 28388 states have (on average 1.5247287586304072) internal successors, (43284), 28647 states have internal predecessors, (43284), 2350 states have call successors, (2350), 1176 states have call predecessors, (2350), 1368 states have return successors, (4361), 2347 states have call predecessors, (4361), 2350 states have call successors, (4361) [2024-10-14 03:23:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32107 states to 32107 states and 49995 transitions. [2024-10-14 03:23:33,510 INFO L78 Accepts]: Start accepts. Automaton has 32107 states and 49995 transitions. Word has length 146 [2024-10-14 03:23:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:33,510 INFO L471 AbstractCegarLoop]: Abstraction has 32107 states and 49995 transitions. [2024-10-14 03:23:33,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:23:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 32107 states and 49995 transitions. [2024-10-14 03:23:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 03:23:33,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:33,591 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:33,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:23:33,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 03:23:33,794 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:33,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:33,796 INFO L85 PathProgramCache]: Analyzing trace with hash -132503488, now seen corresponding path program 1 times [2024-10-14 03:23:33,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967501806] [2024-10-14 03:23:33,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:23:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:23:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 03:23:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:23:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:33,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967501806] [2024-10-14 03:23:33,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967501806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:23:33,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821340642] [2024-10-14 03:23:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:23:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:23:33,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:23:33,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:23:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:34,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:23:34,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:23:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 03:23:34,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:23:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821340642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:34,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:23:34,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 03:23:34,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828714390] [2024-10-14 03:23:34,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:34,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:23:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:34,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:23:34,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:34,219 INFO L87 Difference]: Start difference. First operand 32107 states and 49995 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:23:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:38,321 INFO L93 Difference]: Finished difference Result 95704 states and 150061 transitions. [2024-10-14 03:23:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:23:38,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 146 [2024-10-14 03:23:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:38,778 INFO L225 Difference]: With dead ends: 95704 [2024-10-14 03:23:38,779 INFO L226 Difference]: Without dead ends: 63609 [2024-10-14 03:23:38,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:38,853 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 234 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:38,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 499 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:23:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63609 states. [2024-10-14 03:23:43,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63609 to 63411. [2024-10-14 03:23:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63411 states, 56078 states have (on average 1.5206676414993403) internal successors, (85276), 56595 states have internal predecessors, (85276), 4596 states have call successors, (4596), 2352 states have call predecessors, (4596), 2736 states have return successors, (8555), 4527 states have call predecessors, (8555), 4596 states have call successors, (8555) [2024-10-14 03:23:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63411 states to 63411 states and 98427 transitions. [2024-10-14 03:23:43,397 INFO L78 Accepts]: Start accepts. Automaton has 63411 states and 98427 transitions. Word has length 146 [2024-10-14 03:23:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:43,397 INFO L471 AbstractCegarLoop]: Abstraction has 63411 states and 98427 transitions. [2024-10-14 03:23:43,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:23:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 63411 states and 98427 transitions. [2024-10-14 03:23:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 03:23:43,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:43,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:23:43,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 03:23:43,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-14 03:23:43,693 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:43,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:43,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1597485250, now seen corresponding path program 1 times [2024-10-14 03:23:43,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:43,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910822984] [2024-10-14 03:23:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 03:23:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:23:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:23:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:23:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:23:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:23:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-14 03:23:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:23:43,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:43,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910822984] [2024-10-14 03:23:43,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910822984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:23:43,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434832237] [2024-10-14 03:23:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:43,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:23:43,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:23:43,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:23:43,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:23:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:43,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:23:43,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:23:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 03:23:44,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:23:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434832237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:44,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:23:44,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 03:23:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425870899] [2024-10-14 03:23:44,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:44,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:23:44,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:44,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:23:44,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:44,056 INFO L87 Difference]: Start difference. First operand 63411 states and 98427 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)