./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.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/token_ring.06.cil-2.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 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:15:29,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:15:29,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:15:29,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:15:29,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:15:29,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:15:29,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:15:29,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:15:29,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:15:29,871 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:15:29,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:15:29,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:15:29,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:15:29,872 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:15:29,872 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:15:29,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:15:29,873 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:15:29,873 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:15:29,874 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:15:29,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:15:29,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:15:29,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:15:29,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:15:29,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:15:29,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:15:29,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:15:29,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:15:29,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:15:29,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:15:29,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:15:29,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:15:29,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:15:29,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:15:29,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:15:29,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:15:29,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:15:29,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:15:29,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:15:29,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:15:29,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:15:29,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:15:29,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:15:29,880 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 -> 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 [2024-10-24 01:15:30,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:15:30,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:15:30,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:15:30,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:15:30,160 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:15:30,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-10-24 01:15:31,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:15:31,986 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:15:31,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-10-24 01:15:31,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c89ef072/13bb43cf5e184ea29e93dad961590522/FLAG325a9c93f [2024-10-24 01:15:32,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c89ef072/13bb43cf5e184ea29e93dad961590522 [2024-10-24 01:15:32,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:15:32,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:15:32,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:15:32,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:15:32,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:15:32,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c76e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32, skipping insertion in model container [2024-10-24 01:15:32,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:15:32,502 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c[671,684] [2024-10-24 01:15:32,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:15:32,643 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:15:32,652 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c[671,684] [2024-10-24 01:15:32,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:15:32,715 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:15:32,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32 WrapperNode [2024-10-24 01:15:32,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:15:32,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:15:32,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:15:32,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:15:32,722 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:15:32" (1/1) ... [2024-10-24 01:15:32,734 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:15:32" (1/1) ... [2024-10-24 01:15:32,774 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 519 [2024-10-24 01:15:32,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:15:32,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:15:32,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:15:32,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:15:32,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,807 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:15:32,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:15:32,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:15:32,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:15:32,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:15:32,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (1/1) ... [2024-10-24 01:15:32,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:15:32,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:15:32,874 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:15:32,876 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:15:32,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:15:32,920 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 01:15:32,921 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 01:15:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 01:15:32,921 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 01:15:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 01:15:32,921 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 01:15:32,921 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 01:15:32,921 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 01:15:32,922 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 01:15:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 01:15:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:15:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 01:15:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 01:15:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:15:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:15:33,018 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:15:33,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:15:33,499 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-24 01:15:33,500 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:15:33,533 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:15:33,533 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-24 01:15:33,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:15:33 BoogieIcfgContainer [2024-10-24 01:15:33,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:15:33,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:15:33,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:15:33,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:15:33,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:15:32" (1/3) ... [2024-10-24 01:15:33,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b139451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:15:33, skipping insertion in model container [2024-10-24 01:15:33,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:15:32" (2/3) ... [2024-10-24 01:15:33,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b139451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:15:33, skipping insertion in model container [2024-10-24 01:15:33,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:15:33" (3/3) ... [2024-10-24 01:15:33,541 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2024-10-24 01:15:33,553 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:15:33,554 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:15:33,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:15:33,610 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;@7a5f2d64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:15:33,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:15:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 182 states have (on average 1.7087912087912087) internal successors, (311), 184 states have internal predecessors, (311), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 01:15:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:33,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:33,627 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] [2024-10-24 01:15:33,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:33,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash -938107551, now seen corresponding path program 1 times [2024-10-24 01:15:33,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52565868] [2024-10-24 01:15:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:33,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:33,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:34,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:34,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:34,157 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:15:34,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:34,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52565868] [2024-10-24 01:15:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52565868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:34,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:34,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:15:34,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958985789] [2024-10-24 01:15:34,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:34,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:15:34,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:15:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:15:34,191 INFO L87 Difference]: Start difference. First operand has 210 states, 182 states have (on average 1.7087912087912087) internal successors, (311), 184 states have internal predecessors, (311), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 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:15:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:35,126 INFO L93 Difference]: Finished difference Result 486 states and 821 transitions. [2024-10-24 01:15:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:15:35,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:35,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:35,138 INFO L225 Difference]: With dead ends: 486 [2024-10-24 01:15:35,138 INFO L226 Difference]: Without dead ends: 278 [2024-10-24 01:15:35,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:15:35,145 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 553 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:35,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 379 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 01:15:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-24 01:15:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 208. [2024-10-24 01:15:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.5966850828729282) internal successors, (289), 182 states have internal predecessors, (289), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 01:15:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 329 transitions. [2024-10-24 01:15:35,222 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 329 transitions. Word has length 100 [2024-10-24 01:15:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:35,222 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 329 transitions. [2024-10-24 01:15:35,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 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:15:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 329 transitions. [2024-10-24 01:15:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:35,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:35,228 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] [2024-10-24 01:15:35,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:15:35,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:35,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2005474527, now seen corresponding path program 1 times [2024-10-24 01:15:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:35,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576950748] [2024-10-24 01:15:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:35,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:35,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:35,526 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:15:35,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:35,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576950748] [2024-10-24 01:15:35,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576950748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:35,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:35,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:15:35,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356384967] [2024-10-24 01:15:35,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:35,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:15:35,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:35,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:15:35,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:15:35,530 INFO L87 Difference]: Start difference. First operand 208 states and 329 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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:15:36,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:36,817 INFO L93 Difference]: Finished difference Result 747 states and 1211 transitions. [2024-10-24 01:15:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:15:36,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:36,825 INFO L225 Difference]: With dead ends: 747 [2024-10-24 01:15:36,825 INFO L226 Difference]: Without dead ends: 551 [2024-10-24 01:15:36,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:15:36,828 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 823 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:36,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 631 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 01:15:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-24 01:15:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 412. [2024-10-24 01:15:36,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 363 states have (on average 1.606060606060606) internal successors, (583), 365 states have internal predecessors, (583), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-10-24 01:15:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 656 transitions. [2024-10-24 01:15:36,883 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 656 transitions. Word has length 100 [2024-10-24 01:15:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:36,883 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 656 transitions. [2024-10-24 01:15:36,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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:15:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 656 transitions. [2024-10-24 01:15:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:36,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:36,889 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] [2024-10-24 01:15:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:15:36,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:36,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 748499615, now seen corresponding path program 1 times [2024-10-24 01:15:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655397969] [2024-10-24 01:15:36,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:37,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:37,083 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:15:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:37,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655397969] [2024-10-24 01:15:37,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655397969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:37,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736023720] [2024-10-24 01:15:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:37,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:37,086 INFO L87 Difference]: Start difference. First operand 412 states and 656 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:38,874 INFO L93 Difference]: Finished difference Result 1232 states and 1993 transitions. [2024-10-24 01:15:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:15:38,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:38,878 INFO L225 Difference]: With dead ends: 1232 [2024-10-24 01:15:38,878 INFO L226 Difference]: Without dead ends: 832 [2024-10-24 01:15:38,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:15:38,881 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 836 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:38,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1186 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 01:15:38,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-24 01:15:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 601. [2024-10-24 01:15:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 530 states have (on average 1.5981132075471698) internal successors, (847), 533 states have internal predecessors, (847), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-24 01:15:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 952 transitions. [2024-10-24 01:15:38,928 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 952 transitions. Word has length 100 [2024-10-24 01:15:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:38,929 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 952 transitions. [2024-10-24 01:15:38,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 952 transitions. [2024-10-24 01:15:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:38,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:38,931 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] [2024-10-24 01:15:38,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:15:38,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:38,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1669984863, now seen corresponding path program 1 times [2024-10-24 01:15:38,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:38,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358157251] [2024-10-24 01:15:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:38,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:39,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:39,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:39,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:39,091 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:15:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:39,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358157251] [2024-10-24 01:15:39,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358157251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:39,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:39,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:39,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440197853] [2024-10-24 01:15:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:39,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:39,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:39,093 INFO L87 Difference]: Start difference. First operand 601 states and 952 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:40,674 INFO L93 Difference]: Finished difference Result 1942 states and 3133 transitions. [2024-10-24 01:15:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:15:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:40,682 INFO L225 Difference]: With dead ends: 1942 [2024-10-24 01:15:40,682 INFO L226 Difference]: Without dead ends: 1353 [2024-10-24 01:15:40,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:15:40,687 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 904 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:40,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 784 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 01:15:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-24 01:15:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 980. [2024-10-24 01:15:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.5907514450867053) internal successors, (1376), 870 states have internal predecessors, (1376), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-24 01:15:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1549 transitions. [2024-10-24 01:15:40,751 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1549 transitions. Word has length 100 [2024-10-24 01:15:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:40,751 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1549 transitions. [2024-10-24 01:15:40,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1549 transitions. [2024-10-24 01:15:40,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:40,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:40,754 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] [2024-10-24 01:15:40,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:15:40,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:40,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash 745851487, now seen corresponding path program 1 times [2024-10-24 01:15:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:40,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965617980] [2024-10-24 01:15:40,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:40,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:40,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:40,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:40,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:40,970 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:15:40,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:40,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965617980] [2024-10-24 01:15:40,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965617980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:40,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:40,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191936793] [2024-10-24 01:15:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:40,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:40,972 INFO L87 Difference]: Start difference. First operand 980 states and 1549 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:41,758 INFO L93 Difference]: Finished difference Result 2307 states and 3715 transitions. [2024-10-24 01:15:41,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:15:41,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:41,765 INFO L225 Difference]: With dead ends: 2307 [2024-10-24 01:15:41,765 INFO L226 Difference]: Without dead ends: 1339 [2024-10-24 01:15:41,768 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:15:41,770 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 700 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:41,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 505 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:15:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-10-24 01:15:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 980. [2024-10-24 01:15:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.584971098265896) internal successors, (1371), 870 states have internal predecessors, (1371), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-24 01:15:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1544 transitions. [2024-10-24 01:15:41,827 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1544 transitions. Word has length 100 [2024-10-24 01:15:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:41,828 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1544 transitions. [2024-10-24 01:15:41,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1544 transitions. [2024-10-24 01:15:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:41,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:41,830 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] [2024-10-24 01:15:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:15:41,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1982357859, now seen corresponding path program 1 times [2024-10-24 01:15:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720871394] [2024-10-24 01:15:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:41,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:41,983 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:15:41,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:41,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720871394] [2024-10-24 01:15:41,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720871394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:41,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:41,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:41,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541249062] [2024-10-24 01:15:41,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:41,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:41,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:41,987 INFO L87 Difference]: Start difference. First operand 980 states and 1544 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:42,734 INFO L93 Difference]: Finished difference Result 2301 states and 3688 transitions. [2024-10-24 01:15:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:15:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:42,741 INFO L225 Difference]: With dead ends: 2301 [2024-10-24 01:15:42,742 INFO L226 Difference]: Without dead ends: 1333 [2024-10-24 01:15:42,744 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:15:42,745 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 698 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:42,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 505 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:15:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-24 01:15:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 980. [2024-10-24 01:15:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.5791907514450867) internal successors, (1366), 870 states have internal predecessors, (1366), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-24 01:15:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1539 transitions. [2024-10-24 01:15:42,849 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1539 transitions. Word has length 100 [2024-10-24 01:15:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:42,849 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1539 transitions. [2024-10-24 01:15:42,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1539 transitions. [2024-10-24 01:15:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:42,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:42,851 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] [2024-10-24 01:15:42,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:15:42,851 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1254771359, now seen corresponding path program 1 times [2024-10-24 01:15:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:42,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571626915] [2024-10-24 01:15:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:42,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:42,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:43,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:43,029 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:15:43,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571626915] [2024-10-24 01:15:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571626915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:43,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:43,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:43,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624707632] [2024-10-24 01:15:43,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:43,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:43,031 INFO L87 Difference]: Start difference. First operand 980 states and 1539 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:44,617 INFO L93 Difference]: Finished difference Result 3290 states and 5238 transitions. [2024-10-24 01:15:44,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 01:15:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:44,628 INFO L225 Difference]: With dead ends: 3290 [2024-10-24 01:15:44,628 INFO L226 Difference]: Without dead ends: 2322 [2024-10-24 01:15:44,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 01:15:44,633 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 820 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:44,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1184 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 01:15:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2024-10-24 01:15:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 1754. [2024-10-24 01:15:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1551 states have (on average 1.5718891038039975) internal successors, (2438), 1560 states have internal predecessors, (2438), 140 states have call successors, (140), 54 states have call predecessors, (140), 62 states have return successors, (175), 147 states have call predecessors, (175), 140 states have call successors, (175) [2024-10-24 01:15:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2753 transitions. [2024-10-24 01:15:44,716 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2753 transitions. Word has length 100 [2024-10-24 01:15:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:44,716 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2753 transitions. [2024-10-24 01:15:44,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2753 transitions. [2024-10-24 01:15:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:44,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:44,721 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] [2024-10-24 01:15:44,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:15:44,721 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:44,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash 112268893, now seen corresponding path program 1 times [2024-10-24 01:15:44,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:44,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723397921] [2024-10-24 01:15:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:44,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:44,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:44,883 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:15:44,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:44,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723397921] [2024-10-24 01:15:44,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723397921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:44,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:44,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91027866] [2024-10-24 01:15:44,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:44,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:44,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:44,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:44,885 INFO L87 Difference]: Start difference. First operand 1754 states and 2753 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:46,625 INFO L93 Difference]: Finished difference Result 6662 states and 10600 transitions. [2024-10-24 01:15:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:15:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:46,643 INFO L225 Difference]: With dead ends: 6662 [2024-10-24 01:15:46,643 INFO L226 Difference]: Without dead ends: 4920 [2024-10-24 01:15:46,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:15:46,649 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1043 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:46,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1177 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 01:15:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2024-10-24 01:15:46,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 3287. [2024-10-24 01:15:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2916 states have (on average 1.5679012345679013) internal successors, (4572), 2933 states have internal predecessors, (4572), 252 states have call successors, (252), 102 states have call predecessors, (252), 118 states have return successors, (349), 267 states have call predecessors, (349), 252 states have call successors, (349) [2024-10-24 01:15:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 5173 transitions. [2024-10-24 01:15:46,907 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 5173 transitions. Word has length 100 [2024-10-24 01:15:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:46,908 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 5173 transitions. [2024-10-24 01:15:46,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 5173 transitions. [2024-10-24 01:15:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:46,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:46,912 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] [2024-10-24 01:15:46,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:15:46,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:46,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash 352508639, now seen corresponding path program 1 times [2024-10-24 01:15:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:46,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582249980] [2024-10-24 01:15:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:47,060 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:15:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582249980] [2024-10-24 01:15:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582249980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:47,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:47,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101500888] [2024-10-24 01:15:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:47,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:47,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:47,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:47,063 INFO L87 Difference]: Start difference. First operand 3287 states and 5173 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:49,184 INFO L93 Difference]: Finished difference Result 12537 states and 19994 transitions. [2024-10-24 01:15:49,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:15:49,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:49,217 INFO L225 Difference]: With dead ends: 12537 [2024-10-24 01:15:49,217 INFO L226 Difference]: Without dead ends: 9262 [2024-10-24 01:15:49,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:15:49,229 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 864 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:49,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1173 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 01:15:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2024-10-24 01:15:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 6272. [2024-10-24 01:15:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 5573 states have (on average 1.5657635026018302) internal successors, (8726), 5606 states have internal predecessors, (8726), 468 states have call successors, (468), 198 states have call predecessors, (468), 230 states have return successors, (743), 499 states have call predecessors, (743), 468 states have call successors, (743) [2024-10-24 01:15:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 9937 transitions. [2024-10-24 01:15:49,647 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 9937 transitions. Word has length 100 [2024-10-24 01:15:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:49,648 INFO L471 AbstractCegarLoop]: Abstraction has 6272 states and 9937 transitions. [2024-10-24 01:15:49,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 9937 transitions. [2024-10-24 01:15:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:49,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:49,653 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] [2024-10-24 01:15:49,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:15:49,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:49,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:49,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1191542301, now seen corresponding path program 1 times [2024-10-24 01:15:49,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:49,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698710523] [2024-10-24 01:15:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:49,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:49,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:49,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:49,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:49,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:49,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:49,788 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:15:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698710523] [2024-10-24 01:15:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698710523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754263531] [2024-10-24 01:15:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:49,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:49,790 INFO L87 Difference]: Start difference. First operand 6272 states and 9937 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:50,860 INFO L93 Difference]: Finished difference Result 14361 states and 23119 transitions. [2024-10-24 01:15:50,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:15:50,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:50,887 INFO L225 Difference]: With dead ends: 14361 [2024-10-24 01:15:50,887 INFO L226 Difference]: Without dead ends: 8101 [2024-10-24 01:15:50,901 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:15:50,902 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 611 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:50,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 601 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:15:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2024-10-24 01:15:51,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 6272. [2024-10-24 01:15:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 5573 states have (on average 1.559842095819128) internal successors, (8693), 5606 states have internal predecessors, (8693), 468 states have call successors, (468), 198 states have call predecessors, (468), 230 states have return successors, (743), 499 states have call predecessors, (743), 468 states have call successors, (743) [2024-10-24 01:15:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 9904 transitions. [2024-10-24 01:15:51,269 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 9904 transitions. Word has length 100 [2024-10-24 01:15:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:51,269 INFO L471 AbstractCegarLoop]: Abstraction has 6272 states and 9904 transitions. [2024-10-24 01:15:51,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 9904 transitions. [2024-10-24 01:15:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:51,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:51,274 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] [2024-10-24 01:15:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:15:51,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:51,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1218607903, now seen corresponding path program 1 times [2024-10-24 01:15:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886554250] [2024-10-24 01:15:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:51,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:51,383 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:15:51,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:51,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886554250] [2024-10-24 01:15:51,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886554250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:51,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:51,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:51,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293568682] [2024-10-24 01:15:51,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:51,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:51,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:51,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:51,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:51,385 INFO L87 Difference]: Start difference. First operand 6272 states and 9904 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:53,640 INFO L93 Difference]: Finished difference Result 23406 states and 37392 transitions. [2024-10-24 01:15:53,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:15:53,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:53,695 INFO L225 Difference]: With dead ends: 23406 [2024-10-24 01:15:53,696 INFO L226 Difference]: Without dead ends: 17146 [2024-10-24 01:15:53,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:15:53,713 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 986 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:53,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 784 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 01:15:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17146 states. [2024-10-24 01:15:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17146 to 12354. [2024-10-24 01:15:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12354 states, 11015 states have (on average 1.5579664094416705) internal successors, (17161), 11080 states have internal predecessors, (17161), 884 states have call successors, (884), 390 states have call predecessors, (884), 454 states have return successors, (1677), 947 states have call predecessors, (1677), 884 states have call successors, (1677) [2024-10-24 01:15:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12354 states to 12354 states and 19722 transitions. [2024-10-24 01:15:54,408 INFO L78 Accepts]: Start accepts. Automaton has 12354 states and 19722 transitions. Word has length 100 [2024-10-24 01:15:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:54,408 INFO L471 AbstractCegarLoop]: Abstraction has 12354 states and 19722 transitions. [2024-10-24 01:15:54,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 12354 states and 19722 transitions. [2024-10-24 01:15:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:54,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:54,419 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] [2024-10-24 01:15:54,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:15:54,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:54,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:54,420 INFO L85 PathProgramCache]: Analyzing trace with hash -858728995, now seen corresponding path program 1 times [2024-10-24 01:15:54,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:54,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859787368] [2024-10-24 01:15:54,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:54,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:54,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:54,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:54,524 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:15:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:54,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859787368] [2024-10-24 01:15:54,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859787368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:54,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:54,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:54,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054910762] [2024-10-24 01:15:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:54,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:54,526 INFO L87 Difference]: Start difference. First operand 12354 states and 19722 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:15:56,170 INFO L93 Difference]: Finished difference Result 27959 states and 45370 transitions. [2024-10-24 01:15:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 01:15:56,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:15:56,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:15:56,230 INFO L225 Difference]: With dead ends: 27959 [2024-10-24 01:15:56,230 INFO L226 Difference]: Without dead ends: 15617 [2024-10-24 01:15:56,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:15:56,265 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 614 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 01:15:56,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 601 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 01:15:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states. [2024-10-24 01:15:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 12354. [2024-10-24 01:15:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12354 states, 11015 states have (on average 1.5520653654108034) internal successors, (17096), 11080 states have internal predecessors, (17096), 884 states have call successors, (884), 390 states have call predecessors, (884), 454 states have return successors, (1677), 947 states have call predecessors, (1677), 884 states have call successors, (1677) [2024-10-24 01:15:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12354 states to 12354 states and 19657 transitions. [2024-10-24 01:15:57,297 INFO L78 Accepts]: Start accepts. Automaton has 12354 states and 19657 transitions. Word has length 100 [2024-10-24 01:15:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:15:57,302 INFO L471 AbstractCegarLoop]: Abstraction has 12354 states and 19657 transitions. [2024-10-24 01:15:57,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:15:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 12354 states and 19657 transitions. [2024-10-24 01:15:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:15:57,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:15:57,317 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] [2024-10-24 01:15:57,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:15:57,317 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:15:57,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:15:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash 28493851, now seen corresponding path program 1 times [2024-10-24 01:15:57,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:15:57,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608432881] [2024-10-24 01:15:57,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:15:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:15:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:15:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:15:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:15:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:15:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:15:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:15:57,468 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:15:57,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:15:57,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608432881] [2024-10-24 01:15:57,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608432881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:15:57,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:15:57,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:15:57,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890660343] [2024-10-24 01:15:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:15:57,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:15:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:15:57,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:15:57,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:15:57,470 INFO L87 Difference]: Start difference. First operand 12354 states and 19657 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:16:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:00,727 INFO L93 Difference]: Finished difference Result 43658 states and 70316 transitions. [2024-10-24 01:16:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 01:16:00,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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 100 [2024-10-24 01:16:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:00,819 INFO L225 Difference]: With dead ends: 43658 [2024-10-24 01:16:00,820 INFO L226 Difference]: Without dead ends: 31316 [2024-10-24 01:16:00,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 01:16:00,850 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 803 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:00,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1177 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1987 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 01:16:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31316 states. [2024-10-24 01:16:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31316 to 24645. [2024-10-24 01:16:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24645 states, 22058 states have (on average 1.551455254329495) internal successors, (34222), 22187 states have internal predecessors, (34222), 1684 states have call successors, (1684), 774 states have call predecessors, (1684), 902 states have return successors, (3999), 1811 states have call predecessors, (3999), 1684 states have call successors, (3999) [2024-10-24 01:16:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24645 states to 24645 states and 39905 transitions. [2024-10-24 01:16:02,857 INFO L78 Accepts]: Start accepts. Automaton has 24645 states and 39905 transitions. Word has length 100 [2024-10-24 01:16:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:02,857 INFO L471 AbstractCegarLoop]: Abstraction has 24645 states and 39905 transitions. [2024-10-24 01:16:02,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 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:16:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24645 states and 39905 transitions. [2024-10-24 01:16:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 01:16:02,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:02,870 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] [2024-10-24 01:16:02,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:16:02,870 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:02,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1882548707, now seen corresponding path program 1 times [2024-10-24 01:16:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821570786] [2024-10-24 01:16:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:02,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:16:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:16:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:02,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:16:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:02,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:16:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:02,970 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:16:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:02,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821570786] [2024-10-24 01:16:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821570786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:02,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:16:02,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:16:02,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487157396] [2024-10-24 01:16:02,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:02,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:16:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:16:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:16:02,972 INFO L87 Difference]: Start difference. First operand 24645 states and 39905 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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:16:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:06,361 INFO L93 Difference]: Finished difference Result 70272 states and 113710 transitions. [2024-10-24 01:16:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 01:16:06,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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 100 [2024-10-24 01:16:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:06,504 INFO L225 Difference]: With dead ends: 70272 [2024-10-24 01:16:06,504 INFO L226 Difference]: Without dead ends: 45640 [2024-10-24 01:16:06,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:16:06,564 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1052 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:06,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 910 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 01:16:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45640 states. [2024-10-24 01:16:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45640 to 36885. [2024-10-24 01:16:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 32964 states have (on average 1.5430166241960928) internal successors, (50864), 33222 states have internal predecessors, (50864), 2564 states have call successors, (2564), 1164 states have call predecessors, (2564), 1356 states have return successors, (5609), 2626 states have call predecessors, (5609), 2564 states have call successors, (5609) [2024-10-24 01:16:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 59037 transitions. [2024-10-24 01:16:09,646 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 59037 transitions. Word has length 100 [2024-10-24 01:16:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:09,646 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 59037 transitions. [2024-10-24 01:16:09,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 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:16:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 59037 transitions. [2024-10-24 01:16:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 01:16:09,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:09,718 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:16:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:16:09,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1318711564, now seen corresponding path program 1 times [2024-10-24 01:16:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:09,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777736911] [2024-10-24 01:16:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:09,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:16:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:16:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:16:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:16:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 01:16:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 01:16:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 01:16:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 01:16:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777736911] [2024-10-24 01:16:09,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777736911] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:16:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806548591] [2024-10-24 01:16:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:09,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:16:09,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:16:09,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:16:09,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 01:16:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:09,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 01:16:09,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:16:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 01:16:10,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:16:10,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806548591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:10,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:16:10,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 01:16:10,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439748312] [2024-10-24 01:16:10,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:10,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:16:10,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:16:10,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:10,064 INFO L87 Difference]: Start difference. First operand 36885 states and 59037 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:16:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:16:14,294 INFO L93 Difference]: Finished difference Result 110044 states and 177361 transitions. [2024-10-24 01:16:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:16:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 162 [2024-10-24 01:16:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:16:14,570 INFO L225 Difference]: With dead ends: 110044 [2024-10-24 01:16:14,571 INFO L226 Difference]: Without dead ends: 73172 [2024-10-24 01:16:14,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:14,646 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 274 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:16:14,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 568 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:16:14,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73172 states. [2024-10-24 01:16:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73172 to 72976. [2024-10-24 01:16:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72976 states, 65237 states have (on average 1.5397550469825405) internal successors, (100449), 65752 states have internal predecessors, (100449), 5026 states have call successors, (5026), 2328 states have call predecessors, (5026), 2712 states have return successors, (10989), 5023 states have call predecessors, (10989), 5026 states have call successors, (10989) [2024-10-24 01:16:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72976 states to 72976 states and 116464 transitions. [2024-10-24 01:16:19,858 INFO L78 Accepts]: Start accepts. Automaton has 72976 states and 116464 transitions. Word has length 162 [2024-10-24 01:16:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:16:19,860 INFO L471 AbstractCegarLoop]: Abstraction has 72976 states and 116464 transitions. [2024-10-24 01:16:19,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:16:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 72976 states and 116464 transitions. [2024-10-24 01:16:20,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 01:16:20,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:16:20,234 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:16:20,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 01:16:20,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-24 01:16:20,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:16:20,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:16:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash -352874604, now seen corresponding path program 1 times [2024-10-24 01:16:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:16:20,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89018028] [2024-10-24 01:16:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:20,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:16:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 01:16:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 01:16:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 01:16:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:16:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 01:16:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 01:16:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 01:16:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-24 01:16:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 01:16:20,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:16:20,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89018028] [2024-10-24 01:16:20,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89018028] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 01:16:20,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347514803] [2024-10-24 01:16:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:16:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 01:16:20,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:16:20,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 01:16:20,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 01:16:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:16:20,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 01:16:20,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 01:16:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-24 01:16:20,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 01:16:20,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347514803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:16:20,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 01:16:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-24 01:16:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005163279] [2024-10-24 01:16:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:16:20,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:16:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:16:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:16:20,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:16:20,858 INFO L87 Difference]: Start difference. First operand 72976 states and 116464 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)