./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/transmitter.06.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/transmitter.06.cil.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 bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:17:18,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:17:18,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:17:18,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:17:18,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:17:18,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:17:18,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:17:18,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:17:18,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:17:18,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:17:18,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:17:18,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:17:18,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:17:18,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:17:18,813 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:17:18,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:17:18,814 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:17:18,814 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:17:18,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:17:18,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:17:18,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:17:18,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:17:18,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:17:18,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:17:18,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:17:18,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:17:18,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:17:18,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:17:18,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:17:18,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:17:18,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:17:18,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:17:18,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:17:18,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:17:18,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:17:18,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:17:18,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:17:18,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:17:18,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:17:18,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:17:18,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:17:18,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:17:18,823 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 -> bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df [2024-10-24 01:17:19,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:17:19,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:17:19,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:17:19,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:17:19,125 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:17:19,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c [2024-10-24 01:17:20,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:17:20,768 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:17:20,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c [2024-10-24 01:17:20,782 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db33b19ea/0e5a59107e764183bd9901ba31beca58/FLAGb4a091a21 [2024-10-24 01:17:21,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db33b19ea/0e5a59107e764183bd9901ba31beca58 [2024-10-24 01:17:21,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:17:21,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:17:21,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:17:21,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:17:21,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:17:21,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c88f137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21, skipping insertion in model container [2024-10-24 01:17:21,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:17:21,351 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/transmitter.06.cil.c[706,719] [2024-10-24 01:17:21,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:17:21,449 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:17:21,460 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/transmitter.06.cil.c[706,719] [2024-10-24 01:17:21,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:17:21,549 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:17:21,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21 WrapperNode [2024-10-24 01:17:21,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:17:21,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:17:21,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:17:21,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:17:21,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,614 INFO L138 Inliner]: procedures = 40, calls = 48, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 505 [2024-10-24 01:17:21,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:17:21,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:17:21,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:17:21,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:17:21,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,658 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-24 01:17:21,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:17:21,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:17:21,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:17:21,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:17:21,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (1/1) ... [2024-10-24 01:17:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:17:21,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:17:21,724 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-24 01:17:21,728 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-24 01:17:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:17:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 01:17:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 01:17:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 01:17:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 01:17:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 01:17:21,778 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 01:17:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 01:17:21,780 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 01:17:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 01:17:21,780 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 01:17:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:17:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 01:17:21,781 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 01:17:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:17:21,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:17:21,884 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:17:21,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:17:22,437 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-24 01:17:22,437 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:17:22,498 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:17:22,498 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-24 01:17:22,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:22 BoogieIcfgContainer [2024-10-24 01:17:22,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:17:22,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:17:22,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:17:22,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:17:22,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:17:21" (1/3) ... [2024-10-24 01:17:22,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c6cd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:22, skipping insertion in model container [2024-10-24 01:17:22,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:21" (2/3) ... [2024-10-24 01:17:22,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c6cd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:22, skipping insertion in model container [2024-10-24 01:17:22,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:22" (3/3) ... [2024-10-24 01:17:22,508 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2024-10-24 01:17:22,526 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:17:22,526 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:17:22,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:17:22,601 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;@75b904d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:17:22,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:17:22,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 178 states have (on average 1.7134831460674158) internal successors, (305), 180 states have internal predecessors, (305), 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-24 01:17:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:22,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:22,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:22,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:22,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash -148933588, now seen corresponding path program 1 times [2024-10-24 01:17:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:22,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571569707] [2024-10-24 01:17:22,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:22,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:23,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:23,126 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-24 01:17:23,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571569707] [2024-10-24 01:17:23,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571569707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:23,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:23,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:17:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560630579] [2024-10-24 01:17:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:23,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:17:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:23,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:17:23,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:17:23,172 INFO L87 Difference]: Start difference. First operand has 205 states, 178 states have (on average 1.7134831460674158) internal successors, (305), 180 states have internal predecessors, (305), 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 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:17:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:24,257 INFO L93 Difference]: Finished difference Result 472 states and 796 transitions. [2024-10-24 01:17:24,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:17:24,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-24 01:17:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:24,273 INFO L225 Difference]: With dead ends: 472 [2024-10-24 01:17:24,273 INFO L226 Difference]: Without dead ends: 271 [2024-10-24 01:17:24,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:17:24,286 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 536 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:24,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 365 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 01:17:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-24 01:17:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 203. [2024-10-24 01:17:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 178 states have internal predecessors, (281), 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-24 01:17:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 319 transitions. [2024-10-24 01:17:24,363 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 319 transitions. Word has length 103 [2024-10-24 01:17:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:24,363 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 319 transitions. [2024-10-24 01:17:24,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 01:17:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 319 transitions. [2024-10-24 01:17:24,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:24,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:24,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:24,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:17:24,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:24,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash 907797614, now seen corresponding path program 1 times [2024-10-24 01:17:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:24,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391377979] [2024-10-24 01:17:24,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:24,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:24,676 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-24 01:17:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391377979] [2024-10-24 01:17:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391377979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:17:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673930058] [2024-10-24 01:17:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:24,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:17:24,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:24,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:17:24,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:17:24,682 INFO L87 Difference]: Start difference. First operand 203 states and 319 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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-24 01:17:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:26,244 INFO L93 Difference]: Finished difference Result 727 states and 1178 transitions. [2024-10-24 01:17:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:17:26,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:26,249 INFO L225 Difference]: With dead ends: 727 [2024-10-24 01:17:26,249 INFO L226 Difference]: Without dead ends: 536 [2024-10-24 01:17:26,250 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-24 01:17:26,253 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 796 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:26,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 684 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 01:17:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-24 01:17:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 401. [2024-10-24 01:17:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 354 states have (on average 1.5932203389830508) internal successors, (564), 356 states have internal predecessors, (564), 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-24 01:17:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 633 transitions. [2024-10-24 01:17:26,330 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 633 transitions. Word has length 103 [2024-10-24 01:17:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:26,331 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 633 transitions. [2024-10-24 01:17:26,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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-24 01:17:26,332 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 633 transitions. [2024-10-24 01:17:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:26,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:26,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:26,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:17:26,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1192356975, now seen corresponding path program 1 times [2024-10-24 01:17:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783382724] [2024-10-24 01:17:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:26,582 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-24 01:17:26,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:26,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783382724] [2024-10-24 01:17:26,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783382724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:26,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:26,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:26,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123334515] [2024-10-24 01:17:26,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:26,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:26,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:26,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:26,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:26,589 INFO L87 Difference]: Start difference. First operand 401 states and 633 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:28,972 INFO L93 Difference]: Finished difference Result 1279 states and 2050 transitions. [2024-10-24 01:17:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:17:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:28,983 INFO L225 Difference]: With dead ends: 1279 [2024-10-24 01:17:28,984 INFO L226 Difference]: Without dead ends: 890 [2024-10-24 01:17:28,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:17:28,987 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 862 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:28,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1156 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 01:17:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-24 01:17:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 585. [2024-10-24 01:17:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 517 states have (on average 1.5841392649903288) internal successors, (819), 520 states have internal predecessors, (819), 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-24 01:17:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 918 transitions. [2024-10-24 01:17:29,064 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 918 transitions. Word has length 103 [2024-10-24 01:17:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:29,066 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 918 transitions. [2024-10-24 01:17:29,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 918 transitions. [2024-10-24 01:17:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:29,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:29,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:29,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:17:29,073 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:29,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2107916623, now seen corresponding path program 1 times [2024-10-24 01:17:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993535324] [2024-10-24 01:17:29,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:29,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:29,329 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-24 01:17:29,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:29,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993535324] [2024-10-24 01:17:29,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993535324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:29,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:29,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:29,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401448581] [2024-10-24 01:17:29,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:29,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:29,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:29,335 INFO L87 Difference]: Start difference. First operand 585 states and 918 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:31,610 INFO L93 Difference]: Finished difference Result 1969 states and 3145 transitions. [2024-10-24 01:17:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:17:31,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:31,623 INFO L225 Difference]: With dead ends: 1969 [2024-10-24 01:17:31,624 INFO L226 Difference]: Without dead ends: 1396 [2024-10-24 01:17:31,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:17:31,627 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 866 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:31,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1154 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 01:17:31,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-10-24 01:17:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 954. [2024-10-24 01:17:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.5758293838862558) internal successors, (1330), 849 states have internal predecessors, (1330), 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-24 01:17:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1493 transitions. [2024-10-24 01:17:31,709 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1493 transitions. Word has length 103 [2024-10-24 01:17:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:31,710 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1493 transitions. [2024-10-24 01:17:31,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1493 transitions. [2024-10-24 01:17:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:31,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:31,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:31,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:17:31,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:31,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:31,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1521640401, now seen corresponding path program 1 times [2024-10-24 01:17:31,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:31,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254063282] [2024-10-24 01:17:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:31,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:31,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:31,898 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-24 01:17:31,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:31,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254063282] [2024-10-24 01:17:31,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254063282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:31,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:31,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112106374] [2024-10-24 01:17:31,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:31,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:31,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:31,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:31,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:31,903 INFO L87 Difference]: Start difference. First operand 954 states and 1493 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:32,843 INFO L93 Difference]: Finished difference Result 2242 states and 3572 transitions. [2024-10-24 01:17:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:17:32,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:32,852 INFO L225 Difference]: With dead ends: 2242 [2024-10-24 01:17:32,852 INFO L226 Difference]: Without dead ends: 1300 [2024-10-24 01:17:32,855 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-24 01:17:32,856 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 681 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:32,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 485 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:17:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-10-24 01:17:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 954. [2024-10-24 01:17:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.569905213270142) internal successors, (1325), 849 states have internal predecessors, (1325), 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-24 01:17:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1488 transitions. [2024-10-24 01:17:32,932 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1488 transitions. Word has length 103 [2024-10-24 01:17:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:32,933 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1488 transitions. [2024-10-24 01:17:32,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1488 transitions. [2024-10-24 01:17:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:32,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:32,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:32,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:17:32,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash -896844077, now seen corresponding path program 1 times [2024-10-24 01:17:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339667589] [2024-10-24 01:17:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:33,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:33,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:33,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:33,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:33,113 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-24 01:17:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339667589] [2024-10-24 01:17:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339667589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:33,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027710531] [2024-10-24 01:17:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:33,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:33,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:33,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:33,118 INFO L87 Difference]: Start difference. First operand 954 states and 1488 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:34,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:34,012 INFO L93 Difference]: Finished difference Result 2236 states and 3545 transitions. [2024-10-24 01:17:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:17:34,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:34,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:34,020 INFO L225 Difference]: With dead ends: 2236 [2024-10-24 01:17:34,020 INFO L226 Difference]: Without dead ends: 1294 [2024-10-24 01:17:34,022 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-24 01:17:34,025 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 679 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:34,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 485 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:17:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-10-24 01:17:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 954. [2024-10-24 01:17:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.5639810426540284) internal successors, (1320), 849 states have internal predecessors, (1320), 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-24 01:17:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1483 transitions. [2024-10-24 01:17:34,101 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1483 transitions. Word has length 103 [2024-10-24 01:17:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:34,101 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1483 transitions. [2024-10-24 01:17:34,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1483 transitions. [2024-10-24 01:17:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:34,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:34,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:34,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:17:34,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:34,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:34,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1518992273, now seen corresponding path program 1 times [2024-10-24 01:17:34,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:34,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069092340] [2024-10-24 01:17:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:34,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:34,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:34,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:34,295 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-24 01:17:34,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:34,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069092340] [2024-10-24 01:17:34,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069092340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:34,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:34,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:34,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23214857] [2024-10-24 01:17:34,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:34,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:34,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:34,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:34,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:34,298 INFO L87 Difference]: Start difference. First operand 954 states and 1483 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:36,161 INFO L93 Difference]: Finished difference Result 3281 states and 5168 transitions. [2024-10-24 01:17:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:17:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:36,173 INFO L225 Difference]: With dead ends: 3281 [2024-10-24 01:17:36,174 INFO L226 Difference]: Without dead ends: 2339 [2024-10-24 01:17:36,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:17:36,177 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 848 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:36,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1154 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 01:17:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2024-10-24 01:17:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1708. [2024-10-24 01:17:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1514 states have (on average 1.5561426684280053) internal successors, (2356), 1523 states have internal predecessors, (2356), 131 states have call successors, (131), 54 states have call predecessors, (131), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-10-24 01:17:36,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2653 transitions. [2024-10-24 01:17:36,319 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2653 transitions. Word has length 103 [2024-10-24 01:17:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:36,321 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 2653 transitions. [2024-10-24 01:17:36,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2653 transitions. [2024-10-24 01:17:36,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:36,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:36,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:17:36,325 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1451118829, now seen corresponding path program 1 times [2024-10-24 01:17:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428245662] [2024-10-24 01:17:36,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:36,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:36,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:36,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:36,502 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-24 01:17:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428245662] [2024-10-24 01:17:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428245662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:36,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:36,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855158580] [2024-10-24 01:17:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:36,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:36,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:36,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:36,504 INFO L87 Difference]: Start difference. First operand 1708 states and 2653 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:38,739 INFO L93 Difference]: Finished difference Result 6501 states and 10230 transitions. [2024-10-24 01:17:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:17:38,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:38,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:38,766 INFO L225 Difference]: With dead ends: 6501 [2024-10-24 01:17:38,766 INFO L226 Difference]: Without dead ends: 4805 [2024-10-24 01:17:38,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:17:38,773 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 894 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:38,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1135 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 01:17:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2024-10-24 01:17:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 3193. [2024-10-24 01:17:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 2839 states have (on average 1.5533638605142657) internal successors, (4410), 2856 states have internal predecessors, (4410), 235 states have call successors, (235), 102 states have call predecessors, (235), 118 states have return successors, (332), 250 states have call predecessors, (332), 235 states have call successors, (332) [2024-10-24 01:17:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4977 transitions. [2024-10-24 01:17:39,024 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4977 transitions. Word has length 103 [2024-10-24 01:17:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:39,026 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4977 transitions. [2024-10-24 01:17:39,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4977 transitions. [2024-10-24 01:17:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:39,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:39,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:39,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:17:39,032 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:39,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash 115639121, now seen corresponding path program 1 times [2024-10-24 01:17:39,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:39,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017186581] [2024-10-24 01:17:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:39,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:39,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:39,204 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-24 01:17:39,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:39,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017186581] [2024-10-24 01:17:39,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017186581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:39,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:39,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:39,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891921517] [2024-10-24 01:17:39,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:39,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:39,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:39,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:39,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:39,206 INFO L87 Difference]: Start difference. First operand 3193 states and 4977 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:40,210 INFO L93 Difference]: Finished difference Result 7336 states and 11598 transitions. [2024-10-24 01:17:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:17:40,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:40,228 INFO L225 Difference]: With dead ends: 7336 [2024-10-24 01:17:40,228 INFO L226 Difference]: Without dead ends: 4155 [2024-10-24 01:17:40,235 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-24 01:17:40,238 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 591 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:40,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 579 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:17:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2024-10-24 01:17:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3193. [2024-10-24 01:17:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 2839 states have (on average 1.5473758365621697) internal successors, (4393), 2856 states have internal predecessors, (4393), 235 states have call successors, (235), 102 states have call predecessors, (235), 118 states have return successors, (332), 250 states have call predecessors, (332), 235 states have call successors, (332) [2024-10-24 01:17:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4960 transitions. [2024-10-24 01:17:40,528 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4960 transitions. Word has length 103 [2024-10-24 01:17:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:40,528 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4960 transitions. [2024-10-24 01:17:40,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4960 transitions. [2024-10-24 01:17:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:40,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:40,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:17:40,534 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:40,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash -942198957, now seen corresponding path program 1 times [2024-10-24 01:17:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:40,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928403880] [2024-10-24 01:17:40,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:40,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:40,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:40,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:40,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:40,681 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-24 01:17:40,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:40,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928403880] [2024-10-24 01:17:40,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928403880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:40,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:40,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:40,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720240126] [2024-10-24 01:17:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:40,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:40,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:40,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:40,683 INFO L87 Difference]: Start difference. First operand 3193 states and 4960 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:42,785 INFO L93 Difference]: Finished difference Result 11902 states and 18696 transitions. [2024-10-24 01:17:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:17:42,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:42,831 INFO L225 Difference]: With dead ends: 11902 [2024-10-24 01:17:42,832 INFO L226 Difference]: Without dead ends: 8721 [2024-10-24 01:17:42,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:17:42,850 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 958 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:42,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1135 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 01:17:42,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2024-10-24 01:17:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 6187. [2024-10-24 01:17:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6187 states, 5521 states have (on average 1.5441043289259193) internal successors, (8525), 5554 states have internal predecessors, (8525), 435 states have call successors, (435), 198 states have call predecessors, (435), 230 states have return successors, (710), 466 states have call predecessors, (710), 435 states have call successors, (710) [2024-10-24 01:17:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 9670 transitions. [2024-10-24 01:17:43,458 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 9670 transitions. Word has length 103 [2024-10-24 01:17:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:43,458 INFO L471 AbstractCegarLoop]: Abstraction has 6187 states and 9670 transitions. [2024-10-24 01:17:43,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 9670 transitions. [2024-10-24 01:17:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:43,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:43,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:43,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:17:43,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:43,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:43,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2084701423, now seen corresponding path program 1 times [2024-10-24 01:17:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:43,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408276449] [2024-10-24 01:17:43,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:43,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:43,610 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-24 01:17:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:43,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408276449] [2024-10-24 01:17:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408276449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:43,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:43,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385688184] [2024-10-24 01:17:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:43,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:43,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:43,613 INFO L87 Difference]: Start difference. First operand 6187 states and 9670 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:46,580 INFO L93 Difference]: Finished difference Result 22718 states and 35888 transitions. [2024-10-24 01:17:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:17:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:46,669 INFO L225 Difference]: With dead ends: 22718 [2024-10-24 01:17:46,670 INFO L226 Difference]: Without dead ends: 16543 [2024-10-24 01:17:46,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:17:46,697 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 864 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:46,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1135 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 01:17:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16543 states. [2024-10-24 01:17:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16543 to 12172. [2024-10-24 01:17:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12172 states, 10898 states have (on average 1.5429436593870436) internal successors, (16815), 10963 states have internal predecessors, (16815), 819 states have call successors, (819), 390 states have call predecessors, (819), 454 states have return successors, (1612), 882 states have call predecessors, (1612), 819 states have call successors, (1612) [2024-10-24 01:17:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12172 states to 12172 states and 19246 transitions. [2024-10-24 01:17:47,680 INFO L78 Accepts]: Start accepts. Automaton has 12172 states and 19246 transitions. Word has length 103 [2024-10-24 01:17:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:47,681 INFO L471 AbstractCegarLoop]: Abstraction has 12172 states and 19246 transitions. [2024-10-24 01:17:47,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 12172 states and 19246 transitions. [2024-10-24 01:17:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:47,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:47,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:47,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:17:47,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:47,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1844461677, now seen corresponding path program 1 times [2024-10-24 01:17:47,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:47,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722861110] [2024-10-24 01:17:47,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:47,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:47,853 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-24 01:17:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722861110] [2024-10-24 01:17:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722861110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:47,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:47,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:17:47,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091005831] [2024-10-24 01:17:47,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:47,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:17:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:47,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:17:47,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:17:47,857 INFO L87 Difference]: Start difference. First operand 12172 states and 19246 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:51,674 INFO L93 Difference]: Finished difference Result 43035 states and 68802 transitions. [2024-10-24 01:17:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 01:17:51,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:51,804 INFO L225 Difference]: With dead ends: 43035 [2024-10-24 01:17:51,805 INFO L226 Difference]: Without dead ends: 30875 [2024-10-24 01:17:51,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:17:51,857 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 838 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:51,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1135 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 01:17:51,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30875 states. [2024-10-24 01:17:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30875 to 24206. [2024-10-24 01:17:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24206 states, 21748 states have (on average 1.5443718962663233) internal successors, (33587), 21877 states have internal predecessors, (33587), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-24 01:17:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24206 states to 24206 states and 39012 transitions. [2024-10-24 01:17:53,485 INFO L78 Accepts]: Start accepts. Automaton has 24206 states and 39012 transitions. Word has length 103 [2024-10-24 01:17:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:53,485 INFO L471 AbstractCegarLoop]: Abstraction has 24206 states and 39012 transitions. [2024-10-24 01:17:53,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:17:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 24206 states and 39012 transitions. [2024-10-24 01:17:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:53,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:53,520 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:53,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:17:53,521 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:53,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1817396075, now seen corresponding path program 1 times [2024-10-24 01:17:53,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:53,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613717668] [2024-10-24 01:17:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:53,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:53,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:53,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:53,695 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-24 01:17:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613717668] [2024-10-24 01:17:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613717668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:53,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:53,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:17:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6021201] [2024-10-24 01:17:53,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:53,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:17:53,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:17:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:17:53,697 INFO L87 Difference]: Start difference. First operand 24206 states and 39012 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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-24 01:17:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:17:57,218 INFO L93 Difference]: Finished difference Result 53303 states and 86366 transitions. [2024-10-24 01:17:57,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:17:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 103 [2024-10-24 01:17:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:17:57,338 INFO L225 Difference]: With dead ends: 53303 [2024-10-24 01:17:57,338 INFO L226 Difference]: Without dead ends: 29110 [2024-10-24 01:17:57,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 01:17:57,393 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 267 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 01:17:57,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 652 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 01:17:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29110 states. [2024-10-24 01:17:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29110 to 24208. [2024-10-24 01:17:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24208 states, 21750 states have (on average 1.5384367816091955) internal successors, (33461), 21879 states have internal predecessors, (33461), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-24 01:17:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24208 states to 24208 states and 38886 transitions. [2024-10-24 01:17:59,284 INFO L78 Accepts]: Start accepts. Automaton has 24208 states and 38886 transitions. Word has length 103 [2024-10-24 01:17:59,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:17:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 24208 states and 38886 transitions. [2024-10-24 01:17:59,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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-24 01:17:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24208 states and 38886 transitions. [2024-10-24 01:17:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:17:59,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:17:59,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:17:59,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:17:59,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:17:59,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:17:59,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1984945047, now seen corresponding path program 1 times [2024-10-24 01:17:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:17:59,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732508587] [2024-10-24 01:17:59,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:17:59,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:17:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:59,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:17:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:17:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:17:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:17:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:17:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:17:59,436 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-24 01:17:59,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:17:59,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732508587] [2024-10-24 01:17:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732508587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:17:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:17:59,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:17:59,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28257784] [2024-10-24 01:17:59,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:17:59,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:17:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:17:59,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:17:59,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:17:59,439 INFO L87 Difference]: Start difference. First operand 24208 states and 38886 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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-24 01:18:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:02,342 INFO L93 Difference]: Finished difference Result 53565 states and 86501 transitions. [2024-10-24 01:18:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:18:02,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 103 [2024-10-24 01:18:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:02,449 INFO L225 Difference]: With dead ends: 53565 [2024-10-24 01:18:02,449 INFO L226 Difference]: Without dead ends: 29370 [2024-10-24 01:18:02,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:18:02,511 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 278 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:02,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 652 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:18:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29370 states. [2024-10-24 01:18:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29370 to 24466. [2024-10-24 01:18:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24466 states, 22008 states have (on average 1.5321246819338423) internal successors, (33719), 22137 states have internal predecessors, (33719), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-24 01:18:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24466 states to 24466 states and 39144 transitions. [2024-10-24 01:18:04,203 INFO L78 Accepts]: Start accepts. Automaton has 24466 states and 39144 transitions. Word has length 103 [2024-10-24 01:18:04,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:04,203 INFO L471 AbstractCegarLoop]: Abstraction has 24466 states and 39144 transitions. [2024-10-24 01:18:04,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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-24 01:18:04,203 INFO L276 IsEmpty]: Start isEmpty. Operand 24466 states and 39144 transitions. [2024-10-24 01:18:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:18:04,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:04,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:04,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:18:04,233 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:04,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1930552149, now seen corresponding path program 1 times [2024-10-24 01:18:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640575685] [2024-10-24 01:18:04,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:04,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:18:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:18:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:18:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:04,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:18:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:04,400 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-24 01:18:04,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:04,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640575685] [2024-10-24 01:18:04,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640575685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:04,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:04,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:04,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172730865] [2024-10-24 01:18:04,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:04,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:04,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:04,402 INFO L87 Difference]: Start difference. First operand 24466 states and 39144 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:18:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:13,009 INFO L93 Difference]: Finished difference Result 136801 states and 223349 transitions. [2024-10-24 01:18:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 01:18:13,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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 103 [2024-10-24 01:18:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:13,439 INFO L225 Difference]: With dead ends: 136801 [2024-10-24 01:18:13,439 INFO L226 Difference]: Without dead ends: 112348 [2024-10-24 01:18:13,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-24 01:18:13,742 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 2091 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2107 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:13,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2107 Valid, 1064 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 01:18:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112348 states. [2024-10-24 01:18:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112348 to 93299. [2024-10-24 01:18:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93299 states, 83999 states have (on average 1.5267443660043571) internal successors, (128245), 84512 states have internal predecessors, (128245), 5691 states have call successors, (5691), 3096 states have call predecessors, (5691), 3608 states have return successors, (16707), 5818 states have call predecessors, (16707), 5691 states have call successors, (16707) [2024-10-24 01:18:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93299 states to 93299 states and 150643 transitions. [2024-10-24 01:18:20,892 INFO L78 Accepts]: Start accepts. Automaton has 93299 states and 150643 transitions. Word has length 103 [2024-10-24 01:18:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:20,893 INFO L471 AbstractCegarLoop]: Abstraction has 93299 states and 150643 transitions. [2024-10-24 01:18:20,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 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-24 01:18:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 93299 states and 150643 transitions. [2024-10-24 01:18:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 01:18:20,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:20,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:20,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:18:20,919 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:20,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash -544689228, now seen corresponding path program 1 times [2024-10-24 01:18:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:20,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325620930] [2024-10-24 01:18:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:20,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:18:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:20,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:18:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 01:18:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:21,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 01:18:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:21,030 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-24 01:18:21,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325620930] [2024-10-24 01:18:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325620930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:21,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:21,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:18:21,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992965404] [2024-10-24 01:18:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:21,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:18:21,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:21,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:18:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:21,034 INFO L87 Difference]: Start difference. First operand 93299 states and 150643 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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)