./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.06.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b643fcd36e1cc4587225d57a08c62d9a71f0676d69600864fd61c6c0403013f3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:12:14,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:12:14,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:12:14,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:12:14,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:12:14,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:12:14,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:12:14,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:12:14,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:12:14,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:12:14,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:12:14,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:12:14,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:12:14,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:12:14,876 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:12:14,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:12:14,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:12:14,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:12:14,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:12:14,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:12:14,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:12:14,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:12:14,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:12:14,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:12:14,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:12:14,880 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:12:14,880 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:12:14,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:12:14,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:12:14,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:12:14,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:12:14,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:12:14,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:12:14,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:12:14,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:12:14,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:12:14,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:12:14,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:12:14,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:12:14,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:12:14,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:12:14,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:12:14,884 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-clean/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-clean/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 -> b643fcd36e1cc4587225d57a08c62d9a71f0676d69600864fd61c6c0403013f3 [2024-10-11 04:12:15,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:12:15,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:12:15,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:12:15,118 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:12:15,118 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:12:15,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.06.cil-2.c [2024-10-11 04:12:16,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:12:16,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:12:16,875 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.06.cil-2.c [2024-10-11 04:12:16,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/71da3b5cf/d129cb0f8bf2454aaa3ba39b0aba85ba/FLAGc64a810cf [2024-10-11 04:12:16,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/71da3b5cf/d129cb0f8bf2454aaa3ba39b0aba85ba [2024-10-11 04:12:16,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:12:16,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:12:16,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:12:16,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:12:16,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:12:16,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:12:16" (1/1) ... [2024-10-11 04:12:16,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56e0d642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:16, skipping insertion in model container [2024-10-11 04:12:16,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:12:16" (1/1) ... [2024-10-11 04:12:17,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:12:18,207 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/combinations/Problem05_label41+token_ring.06.cil-2.c[376251,376264] [2024-10-11 04:12:18,230 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/combinations/Problem05_label41+token_ring.06.cil-2.c[383339,383352] [2024-10-11 04:12:18,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:12:18,436 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:12:19,055 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/combinations/Problem05_label41+token_ring.06.cil-2.c[376251,376264] [2024-10-11 04:12:19,067 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/combinations/Problem05_label41+token_ring.06.cil-2.c[383339,383352] [2024-10-11 04:12:19,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:12:19,129 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:12:19,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19 WrapperNode [2024-10-11 04:12:19,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:12:19,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:12:19,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:12:19,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:12:19,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,504 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12873 [2024-10-11 04:12:19,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:12:19,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:12:19,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:12:19,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:12:19,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,688 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-11 04:12:19,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:19,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:20,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:12:20,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:12:20,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:12:20,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:12:20,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (1/1) ... [2024-10-11 04:12:20,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:12:20,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:12:20,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:12:20,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:12:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:12:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:12:20,182 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:12:20,182 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:12:20,183 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:12:20,183 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:12:20,183 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:12:20,183 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:12:20,183 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:12:20,183 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:12:20,183 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:12:20,183 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:12:20,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:12:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:12:20,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:12:20,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:12:20,280 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:12:20,282 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:12:25,990 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2024-10-11 04:12:25,990 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:12:26,073 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:12:26,074 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 04:12:26,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:12:26 BoogieIcfgContainer [2024-10-11 04:12:26,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:12:26,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:12:26,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:12:26,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:12:26,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:12:16" (1/3) ... [2024-10-11 04:12:26,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf6c17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:12:26, skipping insertion in model container [2024-10-11 04:12:26,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:12:19" (2/3) ... [2024-10-11 04:12:26,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf6c17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:12:26, skipping insertion in model container [2024-10-11 04:12:26,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:12:26" (3/3) ... [2024-10-11 04:12:26,083 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.06.cil-2.c [2024-10-11 04:12:26,096 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:12:26,096 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:12:26,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:12:26,200 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;@3a684db9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:12:26,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:12:26,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 2333 states, 2304 states have (on average 1.8815104166666667) internal successors, (4335), 2307 states have internal predecessors, (4335), 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-11 04:12:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:26,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:26,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:26,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:26,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1188096418, now seen corresponding path program 1 times [2024-10-11 04:12:26,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:26,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536873004] [2024-10-11 04:12:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:26,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:26,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:26,686 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-11 04:12:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536873004] [2024-10-11 04:12:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536873004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 04:12:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167440335] [2024-10-11 04:12:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:26,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 04:12:26,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:26,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 04:12:26,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 04:12:26,729 INFO L87 Difference]: Start difference. First operand has 2333 states, 2304 states have (on average 1.8815104166666667) internal successors, (4335), 2307 states have internal predecessors, (4335), 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.2) internal successors, (91), 3 states have internal predecessors, (91), 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-11 04:12:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:27,694 INFO L93 Difference]: Finished difference Result 4728 states and 8858 transitions. [2024-10-11 04:12:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 04:12:27,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:27,723 INFO L225 Difference]: With dead ends: 4728 [2024-10-11 04:12:27,723 INFO L226 Difference]: Without dead ends: 2399 [2024-10-11 04:12:27,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 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-11 04:12:27,736 INFO L432 NwaCegarLoop]: 4143 mSDtfsCounter, 553 mSDsluCounter, 12072 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 16215 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:27,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 16215 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:12:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-11 04:12:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2329. [2024-10-11 04:12:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2301 states have (on average 1.8457192524989134) internal successors, (4247), 2303 states have internal predecessors, (4247), 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-11 04:12:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4287 transitions. [2024-10-11 04:12:27,848 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4287 transitions. Word has length 101 [2024-10-11 04:12:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:27,848 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4287 transitions. [2024-10-11 04:12:27,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 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-11 04:12:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4287 transitions. [2024-10-11 04:12:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:27,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:27,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:27,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:12:27,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:27,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1229807648, now seen corresponding path program 1 times [2024-10-11 04:12:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860084612] [2024-10-11 04:12:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:27,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:28,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:28,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:28,128 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-11 04:12:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860084612] [2024-10-11 04:12:28,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860084612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:28,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:28,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:28,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844091439] [2024-10-11 04:12:28,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:28,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:28,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:28,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:28,135 INFO L87 Difference]: Start difference. First operand 2329 states and 4287 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:29,998 INFO L93 Difference]: Finished difference Result 2881 states and 5198 transitions. [2024-10-11 04:12:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:12:29,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:30,009 INFO L225 Difference]: With dead ends: 2881 [2024-10-11 04:12:30,009 INFO L226 Difference]: Without dead ends: 2685 [2024-10-11 04:12:30,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:12:30,012 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 4743 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4756 SdHoareTripleChecker+Valid, 20974 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:30,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4756 Valid, 20974 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:12:30,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-10-11 04:12:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2536. [2024-10-11 04:12:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2483 states have (on average 1.829238824003222) internal successors, (4542), 2487 states have internal predecessors, (4542), 37 states have call successors, (37), 12 states have call predecessors, (37), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-10-11 04:12:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4623 transitions. [2024-10-11 04:12:30,091 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4623 transitions. Word has length 101 [2024-10-11 04:12:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:30,091 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 4623 transitions. [2024-10-11 04:12:30,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4623 transitions. [2024-10-11 04:12:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:30,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:30,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:30,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:12:30,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:30,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1188676830, now seen corresponding path program 1 times [2024-10-11 04:12:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:30,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222133024] [2024-10-11 04:12:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:30,296 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-11 04:12:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222133024] [2024-10-11 04:12:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222133024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:30,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:30,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814406260] [2024-10-11 04:12:30,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:30,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:30,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:30,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:30,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:30,299 INFO L87 Difference]: Start difference. First operand 2536 states and 4623 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:32,037 INFO L93 Difference]: Finished difference Result 3580 states and 6330 transitions. [2024-10-11 04:12:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:12:32,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:32,051 INFO L225 Difference]: With dead ends: 3580 [2024-10-11 04:12:32,051 INFO L226 Difference]: Without dead ends: 3179 [2024-10-11 04:12:32,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:12:32,056 INFO L432 NwaCegarLoop]: 4202 mSDtfsCounter, 4768 mSDsluCounter, 16681 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4781 SdHoareTripleChecker+Valid, 20883 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:32,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4781 Valid, 20883 Invalid, 2026 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 04:12:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-11 04:12:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2914. [2024-10-11 04:12:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.8008519701810437) internal successors, (5073), 2823 states have internal predecessors, (5073), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:12:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5224 transitions. [2024-10-11 04:12:32,161 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5224 transitions. Word has length 101 [2024-10-11 04:12:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:32,162 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5224 transitions. [2024-10-11 04:12:32,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5224 transitions. [2024-10-11 04:12:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:32,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:32,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:32,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:12:32,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:32,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1227159520, now seen corresponding path program 1 times [2024-10-11 04:12:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:32,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961422901] [2024-10-11 04:12:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:32,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:32,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:32,382 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-11 04:12:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961422901] [2024-10-11 04:12:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961422901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:32,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:32,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:32,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053776005] [2024-10-11 04:12:32,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:32,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:32,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:32,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:32,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:32,385 INFO L87 Difference]: Start difference. First operand 2914 states and 5224 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:33,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:33,308 INFO L93 Difference]: Finished difference Result 3965 states and 6956 transitions. [2024-10-11 04:12:33,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:12:33,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:33,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:33,318 INFO L225 Difference]: With dead ends: 3965 [2024-10-11 04:12:33,319 INFO L226 Difference]: Without dead ends: 3184 [2024-10-11 04:12:33,321 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-11 04:12:33,322 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4644 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4658 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:33,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4658 Valid, 16333 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:12:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2024-10-11 04:12:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2914. [2024-10-11 04:12:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.7990770323038694) internal successors, (5068), 2823 states have internal predecessors, (5068), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:12:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5219 transitions. [2024-10-11 04:12:33,392 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5219 transitions. Word has length 101 [2024-10-11 04:12:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:33,392 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5219 transitions. [2024-10-11 04:12:33,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5219 transitions. [2024-10-11 04:12:33,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:33,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:33,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:33,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:12:33,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:33,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1742951582, now seen corresponding path program 1 times [2024-10-11 04:12:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:33,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766516] [2024-10-11 04:12:33,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:33,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:33,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:33,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:33,555 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-11 04:12:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:33,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766516] [2024-10-11 04:12:33,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:33,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:33,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:33,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284402727] [2024-10-11 04:12:33,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:33,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:33,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:33,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:33,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:33,561 INFO L87 Difference]: Start difference. First operand 2914 states and 5219 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:34,321 INFO L93 Difference]: Finished difference Result 3961 states and 6935 transitions. [2024-10-11 04:12:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:12:34,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:34,331 INFO L225 Difference]: With dead ends: 3961 [2024-10-11 04:12:34,331 INFO L226 Difference]: Without dead ends: 3180 [2024-10-11 04:12:34,334 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-11 04:12:34,335 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4642 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4656 SdHoareTripleChecker+Valid, 16333 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:34,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4656 Valid, 16333 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:12:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2024-10-11 04:12:34,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2914. [2024-10-11 04:12:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.797302094426695) internal successors, (5063), 2823 states have internal predecessors, (5063), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:12:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5214 transitions. [2024-10-11 04:12:34,401 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5214 transitions. Word has length 101 [2024-10-11 04:12:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:34,402 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5214 transitions. [2024-10-11 04:12:34,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:34,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5214 transitions. [2024-10-11 04:12:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:34,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:34,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:34,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:12:34,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:34,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash -176193632, now seen corresponding path program 1 times [2024-10-11 04:12:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733491251] [2024-10-11 04:12:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:34,518 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-11 04:12:34,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733491251] [2024-10-11 04:12:34,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733491251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:34,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:34,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:34,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864784897] [2024-10-11 04:12:34,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:34,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:34,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:34,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:34,520 INFO L87 Difference]: Start difference. First operand 2914 states and 5214 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:35,309 INFO L93 Difference]: Finished difference Result 3956 states and 6912 transitions. [2024-10-11 04:12:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 04:12:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:35,322 INFO L225 Difference]: With dead ends: 3956 [2024-10-11 04:12:35,322 INFO L226 Difference]: Without dead ends: 3175 [2024-10-11 04:12:35,325 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-11 04:12:35,325 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4555 mSDsluCounter, 16280 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 20387 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:35,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 20387 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:12:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2024-10-11 04:12:35,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2914. [2024-10-11 04:12:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2914 states, 2817 states have (on average 1.7955271565495208) internal successors, (5058), 2823 states have internal predecessors, (5058), 67 states have call successors, (67), 24 states have call predecessors, (67), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-10-11 04:12:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5209 transitions. [2024-10-11 04:12:35,400 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5209 transitions. Word has length 101 [2024-10-11 04:12:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:35,401 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5209 transitions. [2024-10-11 04:12:35,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5209 transitions. [2024-10-11 04:12:35,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:35,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:35,402 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:35,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:12:35,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:35,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1234031710, now seen corresponding path program 1 times [2024-10-11 04:12:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:35,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869921206] [2024-10-11 04:12:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:35,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:35,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:35,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:35,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:35,537 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-11 04:12:35,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:35,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869921206] [2024-10-11 04:12:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869921206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:35,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:35,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689993231] [2024-10-11 04:12:35,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:35,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:35,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:35,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:35,539 INFO L87 Difference]: Start difference. First operand 2914 states and 5209 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:37,024 INFO L93 Difference]: Finished difference Result 4927 states and 8441 transitions. [2024-10-11 04:12:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:12:37,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:37,037 INFO L225 Difference]: With dead ends: 4927 [2024-10-11 04:12:37,038 INFO L226 Difference]: Without dead ends: 4148 [2024-10-11 04:12:37,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:12:37,041 INFO L432 NwaCegarLoop]: 4240 mSDtfsCounter, 4734 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 20973 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:37,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 20973 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:12:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2024-10-11 04:12:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 3681. [2024-10-11 04:12:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3496 states have (on average 1.7502860411899313) internal successors, (6119), 3506 states have internal predecessors, (6119), 127 states have call successors, (127), 48 states have call predecessors, (127), 56 states have return successors, (170), 134 states have call predecessors, (170), 127 states have call successors, (170) [2024-10-11 04:12:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6416 transitions. [2024-10-11 04:12:37,151 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6416 transitions. Word has length 101 [2024-10-11 04:12:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:37,152 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 6416 transitions. [2024-10-11 04:12:37,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6416 transitions. [2024-10-11 04:12:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:37,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:37,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:37,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:12:37,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:37,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1918433120, now seen corresponding path program 1 times [2024-10-11 04:12:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325758765] [2024-10-11 04:12:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:37,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:37,293 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-11 04:12:37,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:37,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325758765] [2024-10-11 04:12:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325758765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:37,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:37,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:37,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972515837] [2024-10-11 04:12:37,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:37,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:37,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:37,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:37,295 INFO L87 Difference]: Start difference. First operand 3681 states and 6416 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:38,874 INFO L93 Difference]: Finished difference Result 8286 states and 13806 transitions. [2024-10-11 04:12:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:38,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:38,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:38,901 INFO L225 Difference]: With dead ends: 8286 [2024-10-11 04:12:38,901 INFO L226 Difference]: Without dead ends: 6740 [2024-10-11 04:12:38,908 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-11 04:12:38,910 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4964 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:38,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4984 Valid, 20963 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:12:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2024-10-11 04:12:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 5206. [2024-10-11 04:12:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5206 states, 4853 states have (on average 1.6985369874304554) internal successors, (8243), 4871 states have internal predecessors, (8243), 239 states have call successors, (239), 96 states have call predecessors, (239), 112 states have return successors, (352), 254 states have call predecessors, (352), 239 states have call successors, (352) [2024-10-11 04:12:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 8834 transitions. [2024-10-11 04:12:39,159 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 8834 transitions. Word has length 101 [2024-10-11 04:12:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:39,159 INFO L471 AbstractCegarLoop]: Abstraction has 5206 states and 8834 transitions. [2024-10-11 04:12:39,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 8834 transitions. [2024-10-11 04:12:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:39,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:39,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:39,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:12:39,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:39,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2136294430, now seen corresponding path program 1 times [2024-10-11 04:12:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:39,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457117067] [2024-10-11 04:12:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:39,300 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-11 04:12:39,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:39,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457117067] [2024-10-11 04:12:39,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457117067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:39,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:39,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038183003] [2024-10-11 04:12:39,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:39,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:39,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:39,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:39,303 INFO L87 Difference]: Start difference. First operand 5206 states and 8834 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:40,988 INFO L93 Difference]: Finished difference Result 13949 states and 22916 transitions. [2024-10-11 04:12:40,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:40,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:40,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:41,019 INFO L225 Difference]: With dead ends: 13949 [2024-10-11 04:12:41,019 INFO L226 Difference]: Without dead ends: 10878 [2024-10-11 04:12:41,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:41,031 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 4907 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4927 SdHoareTripleChecker+Valid, 20965 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:41,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4927 Valid, 20965 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:12:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10878 states. [2024-10-11 04:12:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10878 to 8271. [2024-10-11 04:12:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8271 states, 7590 states have (on average 1.6517786561264822) internal successors, (12537), 7624 states have internal predecessors, (12537), 455 states have call successors, (455), 192 states have call predecessors, (455), 224 states have return successors, (762), 486 states have call predecessors, (762), 455 states have call successors, (762) [2024-10-11 04:12:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8271 states to 8271 states and 13754 transitions. [2024-10-11 04:12:41,584 INFO L78 Accepts]: Start accepts. Automaton has 8271 states and 13754 transitions. Word has length 101 [2024-10-11 04:12:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:41,585 INFO L471 AbstractCegarLoop]: Abstraction has 8271 states and 13754 transitions. [2024-10-11 04:12:41,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8271 states and 13754 transitions. [2024-10-11 04:12:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:41,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:41,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:41,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:12:41,590 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:41,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:41,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2109228828, now seen corresponding path program 1 times [2024-10-11 04:12:41,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:41,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861099728] [2024-10-11 04:12:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:41,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:41,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:41,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:41,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:41,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:41,738 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-11 04:12:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:41,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861099728] [2024-10-11 04:12:41,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861099728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:41,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:41,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982001473] [2024-10-11 04:12:41,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:41,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:41,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:41,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:41,740 INFO L87 Difference]: Start difference. First operand 8271 states and 13754 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:44,101 INFO L93 Difference]: Finished difference Result 25224 states and 41230 transitions. [2024-10-11 04:12:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:44,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:44,154 INFO L225 Difference]: With dead ends: 25224 [2024-10-11 04:12:44,154 INFO L226 Difference]: Without dead ends: 19088 [2024-10-11 04:12:44,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:44,176 INFO L432 NwaCegarLoop]: 4204 mSDtfsCounter, 4884 mSDsluCounter, 16679 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4904 SdHoareTripleChecker+Valid, 20883 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:44,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4904 Valid, 20883 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 04:12:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19088 states. [2024-10-11 04:12:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19088 to 14401. [2024-10-11 04:12:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14401 states, 13080 states have (on average 1.6175076452599388) internal successors, (21157), 13146 states have internal predecessors, (21157), 871 states have call successors, (871), 384 states have call predecessors, (871), 448 states have return successors, (1728), 934 states have call predecessors, (1728), 871 states have call successors, (1728) [2024-10-11 04:12:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14401 states to 14401 states and 23756 transitions. [2024-10-11 04:12:44,803 INFO L78 Accepts]: Start accepts. Automaton has 14401 states and 23756 transitions. Word has length 101 [2024-10-11 04:12:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:44,803 INFO L471 AbstractCegarLoop]: Abstraction has 14401 states and 23756 transitions. [2024-10-11 04:12:44,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 14401 states and 23756 transitions. [2024-10-11 04:12:44,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:44,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:44,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:44,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:12:44,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:44,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash 108401570, now seen corresponding path program 1 times [2024-10-11 04:12:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:44,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008702355] [2024-10-11 04:12:44,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:44,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:44,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:44,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:44,929 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-11 04:12:44,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:44,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008702355] [2024-10-11 04:12:44,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008702355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:44,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:44,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:44,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180335190] [2024-10-11 04:12:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:44,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:44,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:44,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:44,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:44,931 INFO L87 Difference]: Start difference. First operand 14401 states and 23756 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:48,053 INFO L93 Difference]: Finished difference Result 47294 states and 77674 transitions. [2024-10-11 04:12:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:48,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:48,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:48,159 INFO L225 Difference]: With dead ends: 47294 [2024-10-11 04:12:48,160 INFO L226 Difference]: Without dead ends: 35028 [2024-10-11 04:12:48,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:48,198 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4775 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:48,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 20963 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 04:12:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2024-10-11 04:12:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 26661. [2024-10-11 04:12:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26661 states, 24092 states have (on average 1.596422048812884) internal successors, (38461), 24222 states have internal predecessors, (38461), 1671 states have call successors, (1671), 768 states have call predecessors, (1671), 896 states have return successors, (4114), 1798 states have call predecessors, (4114), 1671 states have call successors, (4114) [2024-10-11 04:12:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26661 states to 26661 states and 44246 transitions. [2024-10-11 04:12:49,866 INFO L78 Accepts]: Start accepts. Automaton has 26661 states and 44246 transitions. Word has length 101 [2024-10-11 04:12:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:49,867 INFO L471 AbstractCegarLoop]: Abstraction has 26661 states and 44246 transitions. [2024-10-11 04:12:49,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 26661 states and 44246 transitions. [2024-10-11 04:12:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:49,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:49,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:49,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:12:49,886 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:49,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1842506020, now seen corresponding path program 1 times [2024-10-11 04:12:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:49,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172767767] [2024-10-11 04:12:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:49,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:50,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:50,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:50,014 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-11 04:12:50,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172767767] [2024-10-11 04:12:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172767767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:50,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:50,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:50,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724174796] [2024-10-11 04:12:50,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:50,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:50,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:50,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:50,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:50,016 INFO L87 Difference]: Start difference. First operand 26661 states and 44246 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:12:54,456 INFO L93 Difference]: Finished difference Result 90474 states and 150842 transitions. [2024-10-11 04:12:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:12:54,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:12:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:12:54,672 INFO L225 Difference]: With dead ends: 90474 [2024-10-11 04:12:54,672 INFO L226 Difference]: Without dead ends: 65948 [2024-10-11 04:12:54,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:12:54,734 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4805 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4825 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:12:54,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4825 Valid, 20963 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:12:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65948 states. [2024-10-11 04:12:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65948 to 51181. [2024-10-11 04:12:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51181 states, 46180 states have (on average 1.585036812472932) internal successors, (73197), 46438 states have internal predecessors, (73197), 3207 states have call successors, (3207), 1536 states have call predecessors, (3207), 1792 states have return successors, (10280), 3462 states have call predecessors, (10280), 3207 states have call successors, (10280) [2024-10-11 04:12:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51181 states to 51181 states and 86684 transitions. [2024-10-11 04:12:58,282 INFO L78 Accepts]: Start accepts. Automaton has 51181 states and 86684 transitions. Word has length 101 [2024-10-11 04:12:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:12:58,282 INFO L471 AbstractCegarLoop]: Abstraction has 51181 states and 86684 transitions. [2024-10-11 04:12:58,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:12:58,282 INFO L276 IsEmpty]: Start isEmpty. Operand 51181 states and 86684 transitions. [2024-10-11 04:12:58,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:12:58,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:12:58,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:12:58,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:12:58,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:12:58,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:12:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1565238430, now seen corresponding path program 1 times [2024-10-11 04:12:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:12:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445573595] [2024-10-11 04:12:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:12:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:12:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:12:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:58,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:12:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:58,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:12:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:12:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:12:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:12:58,424 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-11 04:12:58,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:12:58,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445573595] [2024-10-11 04:12:58,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445573595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:12:58,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:12:58,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:12:58,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531598175] [2024-10-11 04:12:58,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:12:58,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:12:58,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:12:58,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:12:58,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:12:58,427 INFO L87 Difference]: Start difference. First operand 51181 states and 86684 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:13:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:13:07,155 INFO L93 Difference]: Finished difference Result 174914 states and 299682 transitions. [2024-10-11 04:13:07,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:13:07,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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 101 [2024-10-11 04:13:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:13:07,846 INFO L225 Difference]: With dead ends: 174914 [2024-10-11 04:13:07,846 INFO L226 Difference]: Without dead ends: 125868 [2024-10-11 04:13:07,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:13:07,955 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4756 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4768 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:13:07,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4768 Valid, 20963 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 04:13:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125868 states. [2024-10-11 04:13:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125868 to 100221. [2024-10-11 04:13:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100221 states, 90484 states have (on average 1.5795610273639538) internal successors, (142925), 90998 states have internal predecessors, (142925), 6151 states have call successors, (6151), 3072 states have call predecessors, (6151), 3584 states have return successors, (26858), 6662 states have call predecessors, (26858), 6151 states have call successors, (26858) [2024-10-11 04:13:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100221 states to 100221 states and 175934 transitions. [2024-10-11 04:13:15,156 INFO L78 Accepts]: Start accepts. Automaton has 100221 states and 175934 transitions. Word has length 101 [2024-10-11 04:13:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:13:15,157 INFO L471 AbstractCegarLoop]: Abstraction has 100221 states and 175934 transitions. [2024-10-11 04:13:15,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 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-11 04:13:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 100221 states and 175934 transitions. [2024-10-11 04:13:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:13:15,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:13:15,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:13:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:13:15,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:13:15,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:13:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash 818686308, now seen corresponding path program 1 times [2024-10-11 04:13:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:13:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268179245] [2024-10-11 04:13:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:13:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:13:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:13:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 04:13:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 04:13:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 04:13:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 04:13:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:13:15,320 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-11 04:13:15,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:13:15,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268179245] [2024-10-11 04:13:15,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268179245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:13:15,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:13:15,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:13:15,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899870503] [2024-10-11 04:13:15,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:13:15,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:13:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:13:15,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:13:15,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:13:15,322 INFO L87 Difference]: Start difference. First operand 100221 states and 175934 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 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)