./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_label42+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.06.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 254b993103fdf4bf9ce113a41b03b165c45b47461a75aeb8bd9480761428c91e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:54:37,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:54:37,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:54:37,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:54:37,717 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:54:37,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:54:37,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:54:37,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:54:37,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:54:37,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:54:37,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:54:37,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:54:37,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:54:37,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:54:37,755 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:54:37,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:54:37,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:54:37,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:54:37,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:54:37,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:54:37,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:54:37,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:54:37,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:54:37,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:54:37,759 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:54:37,759 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:54:37,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:54:37,760 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:54:37,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:54:37,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:54:37,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:54:37,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:54:37,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:54:37,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:54:37,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:54:37,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:54:37,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:54:37,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:54:37,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:54:37,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:54:37,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:54:37,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:54:37,764 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 254b993103fdf4bf9ce113a41b03b165c45b47461a75aeb8bd9480761428c91e [2024-10-12 20:54:38,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:54:38,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:54:38,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:54:38,099 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:54:38,100 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:54:38,101 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.06.cil-2.c [2024-10-12 20:54:39,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:54:40,121 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:54:40,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.06.cil-2.c [2024-10-12 20:54:40,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e4ec6279/450671ce89474daeabe189573d0dca57/FLAGe3e2b29e3 [2024-10-12 20:54:40,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e4ec6279/450671ce89474daeabe189573d0dca57 [2024-10-12 20:54:40,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:54:40,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:54:40,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:54:40,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:54:40,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:54:40,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:54:40" (1/1) ... [2024-10-12 20:54:40,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43cd338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:40, skipping insertion in model container [2024-10-12 20:54:40,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:54:40" (1/1) ... [2024-10-12 20:54:40,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:54:42,089 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_label42+token_ring.06.cil-2.c[378560,378573] [2024-10-12 20:54:42,118 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_label42+token_ring.06.cil-2.c[383339,383352] [2024-10-12 20:54:42,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:54:42,337 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:54:43,158 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_label42+token_ring.06.cil-2.c[378560,378573] [2024-10-12 20:54:43,167 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_label42+token_ring.06.cil-2.c[383339,383352] [2024-10-12 20:54:43,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:54:43,247 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:54:43,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43 WrapperNode [2024-10-12 20:54:43,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:54:43,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:54:43,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:54:43,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:54:43,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:43,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:43,741 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12873 [2024-10-12 20:54:43,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:54:43,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:54:43,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:54:43,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:54:43,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:43,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:43,821 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:43,904 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-12 20:54:43,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:43,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:44,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:44,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:44,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:44,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:44,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:54:44,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:54:44,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:54:44,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:54:44,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (1/1) ... [2024-10-12 20:54:44,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:54:44,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:54:44,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:54:44,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:54:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:54:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:54:44,512 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:54:44,512 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:54:44,514 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:54:44,514 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:54:44,514 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:54:44,514 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:54:44,514 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:54:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:54:44,515 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:54:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:54:44,515 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:54:44,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:54:44,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:54:44,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:54:44,669 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:54:44,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:54:52,686 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2024-10-12 20:54:52,686 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:54:52,788 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:54:52,788 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-12 20:54:52,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:54:52 BoogieIcfgContainer [2024-10-12 20:54:52,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:54:52,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:54:52,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:54:52,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:54:52,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:54:40" (1/3) ... [2024-10-12 20:54:52,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb0baa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:54:52, skipping insertion in model container [2024-10-12 20:54:52,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:54:43" (2/3) ... [2024-10-12 20:54:52,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb0baa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:54:52, skipping insertion in model container [2024-10-12 20:54:52,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:54:52" (3/3) ... [2024-10-12 20:54:52,798 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.06.cil-2.c [2024-10-12 20:54:52,814 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:54:52,815 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:54:52,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:54:52,940 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;@13c16795, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:54:52,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:54:52,952 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-12 20:54:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:54:52,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:52,967 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-12 20:54:52,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:52,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:52,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1188096418, now seen corresponding path program 1 times [2024-10-12 20:54:52,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401835138] [2024-10-12 20:54:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:53,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:53,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:54:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:54:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:54:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:54:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:53,469 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-12 20:54:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401835138] [2024-10-12 20:54:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401835138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:53,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:53,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:54:53,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855556286] [2024-10-12 20:54:53,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:53,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:54:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:53,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:54:53,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:54:53,508 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-12 20:54:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:54,726 INFO L93 Difference]: Finished difference Result 4728 states and 8858 transitions. [2024-10-12 20:54:54,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:54:54,729 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-12 20:54:54,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:54,760 INFO L225 Difference]: With dead ends: 4728 [2024-10-12 20:54:54,760 INFO L226 Difference]: Without dead ends: 2399 [2024-10-12 20:54:54,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:54:54,776 INFO L432 NwaCegarLoop]: 4143 mSDtfsCounter, 553 mSDsluCounter, 12072 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 16215 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:54,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 16215 Invalid, 643 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:54:54,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-12 20:54:54,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2329. [2024-10-12 20:54:54,923 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-12 20:54:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 4287 transitions. [2024-10-12 20:54:54,934 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 4287 transitions. Word has length 101 [2024-10-12 20:54:54,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:54,935 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 4287 transitions. [2024-10-12 20:54:54,936 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-12 20:54:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 4287 transitions. [2024-10-12 20:54:54,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:54:54,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:54,944 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-12 20:54:54,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:54:54,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:54,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1229807648, now seen corresponding path program 1 times [2024-10-12 20:54:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60070932] [2024-10-12 20:54:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:54,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:54:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:55,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:54:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:55,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:54:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:55,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:54:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:55,372 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-12 20:54:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60070932] [2024-10-12 20:54:55,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60070932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:55,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:55,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:55,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036068519] [2024-10-12 20:54:55,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:55,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:55,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:55,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:55,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:55,376 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-12 20:54:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:54:57,703 INFO L93 Difference]: Finished difference Result 2881 states and 5198 transitions. [2024-10-12 20:54:57,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:54:57,704 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-12 20:54:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:54:57,720 INFO L225 Difference]: With dead ends: 2881 [2024-10-12 20:54:57,721 INFO L226 Difference]: Without dead ends: 2685 [2024-10-12 20:54:57,724 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-12 20:54:57,726 INFO L432 NwaCegarLoop]: 4241 mSDtfsCounter, 4743 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4756 SdHoareTripleChecker+Valid, 20974 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:54:57,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4756 Valid, 20974 Invalid, 2226 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:54:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2024-10-12 20:54:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2536. [2024-10-12 20:54:57,802 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-12 20:54:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 4623 transitions. [2024-10-12 20:54:57,815 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 4623 transitions. Word has length 101 [2024-10-12 20:54:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:54:57,816 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 4623 transitions. [2024-10-12 20:54:57,817 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-12 20:54:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 4623 transitions. [2024-10-12 20:54:57,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:54:57,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:54:57,823 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-12 20:54:57,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:54:57,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:54:57,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:54:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1188676830, now seen corresponding path program 1 times [2024-10-12 20:54:57,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:54:57,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995966225] [2024-10-12 20:54:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:54:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:54:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:54:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:57,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:54:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:58,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:54:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:54:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:54:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:54:58,063 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-12 20:54:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:54:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995966225] [2024-10-12 20:54:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995966225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:54:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:54:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:54:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156975822] [2024-10-12 20:54:58,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:54:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:54:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:54:58,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:54:58,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:54:58,073 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-12 20:55:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:00,183 INFO L93 Difference]: Finished difference Result 3580 states and 6330 transitions. [2024-10-12 20:55:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:55:00,184 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-12 20:55:00,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:00,203 INFO L225 Difference]: With dead ends: 3580 [2024-10-12 20:55:00,204 INFO L226 Difference]: Without dead ends: 3179 [2024-10-12 20:55:00,207 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-12 20:55:00,208 INFO L432 NwaCegarLoop]: 4202 mSDtfsCounter, 4768 mSDsluCounter, 16681 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:00,208 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.5s Time] [2024-10-12 20:55:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-12 20:55:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2914. [2024-10-12 20:55:00,324 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-12 20:55:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5224 transitions. [2024-10-12 20:55:00,337 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5224 transitions. Word has length 101 [2024-10-12 20:55:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:00,338 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5224 transitions. [2024-10-12 20:55:00,338 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-12 20:55:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5224 transitions. [2024-10-12 20:55:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:00,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:00,341 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-12 20:55:00,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:55:00,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:00,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1227159520, now seen corresponding path program 1 times [2024-10-12 20:55:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909717237] [2024-10-12 20:55:00,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:00,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:00,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:00,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:00,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:00,573 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-12 20:55:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909717237] [2024-10-12 20:55:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909717237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456595633] [2024-10-12 20:55:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:00,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:00,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:00,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:00,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:00,579 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-12 20:55:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:01,802 INFO L93 Difference]: Finished difference Result 3965 states and 6956 transitions. [2024-10-12 20:55:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:55:01,803 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-12 20:55:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:01,819 INFO L225 Difference]: With dead ends: 3965 [2024-10-12 20:55:01,820 INFO L226 Difference]: Without dead ends: 3184 [2024-10-12 20:55:01,823 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-12 20:55:01,826 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4644 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:01,827 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.8s Time] [2024-10-12 20:55:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states. [2024-10-12 20:55:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 2914. [2024-10-12 20:55:01,928 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-12 20:55:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5219 transitions. [2024-10-12 20:55:01,940 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5219 transitions. Word has length 101 [2024-10-12 20:55:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:01,941 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5219 transitions. [2024-10-12 20:55:01,942 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-12 20:55:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5219 transitions. [2024-10-12 20:55:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:01,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:01,944 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-12 20:55:01,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:55:01,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:01,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:01,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1742951582, now seen corresponding path program 1 times [2024-10-12 20:55:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:01,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581235246] [2024-10-12 20:55:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:02,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:02,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:02,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:02,125 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-12 20:55:02,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:02,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581235246] [2024-10-12 20:55:02,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581235246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:02,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:02,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255737160] [2024-10-12 20:55:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:02,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:02,128 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-12 20:55:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:03,062 INFO L93 Difference]: Finished difference Result 3961 states and 6935 transitions. [2024-10-12 20:55:03,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:55:03,063 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-12 20:55:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:03,077 INFO L225 Difference]: With dead ends: 3961 [2024-10-12 20:55:03,077 INFO L226 Difference]: Without dead ends: 3180 [2024-10-12 20:55:03,081 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-12 20:55:03,083 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4642 mSDsluCounter, 12226 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:03,083 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.7s Time] [2024-10-12 20:55:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2024-10-12 20:55:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2914. [2024-10-12 20:55:03,183 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-12 20:55:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5214 transitions. [2024-10-12 20:55:03,195 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5214 transitions. Word has length 101 [2024-10-12 20:55:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:03,196 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5214 transitions. [2024-10-12 20:55:03,196 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-12 20:55:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5214 transitions. [2024-10-12 20:55:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:03,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:03,198 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-12 20:55:03,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:55:03,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:03,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:03,199 INFO L85 PathProgramCache]: Analyzing trace with hash -176193632, now seen corresponding path program 1 times [2024-10-12 20:55:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:03,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971591564] [2024-10-12 20:55:03,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:03,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:03,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:03,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:03,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:03,363 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-12 20:55:03,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:03,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971591564] [2024-10-12 20:55:03,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971591564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:03,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:03,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:03,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072142463] [2024-10-12 20:55:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:03,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:03,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:03,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:03,371 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-12 20:55:04,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:04,389 INFO L93 Difference]: Finished difference Result 3956 states and 6912 transitions. [2024-10-12 20:55:04,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:55:04,390 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-12 20:55:04,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:04,405 INFO L225 Difference]: With dead ends: 3956 [2024-10-12 20:55:04,405 INFO L226 Difference]: Without dead ends: 3175 [2024-10-12 20:55:04,409 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-12 20:55:04,414 INFO L432 NwaCegarLoop]: 4107 mSDtfsCounter, 4555 mSDsluCounter, 16280 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:04,416 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.8s Time] [2024-10-12 20:55:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2024-10-12 20:55:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2914. [2024-10-12 20:55:04,512 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-12 20:55:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2914 states and 5209 transitions. [2024-10-12 20:55:04,523 INFO L78 Accepts]: Start accepts. Automaton has 2914 states and 5209 transitions. Word has length 101 [2024-10-12 20:55:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:04,524 INFO L471 AbstractCegarLoop]: Abstraction has 2914 states and 5209 transitions. [2024-10-12 20:55:04,524 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-12 20:55:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2914 states and 5209 transitions. [2024-10-12 20:55:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:04,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:04,526 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-12 20:55:04,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:55:04,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:04,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1234031710, now seen corresponding path program 1 times [2024-10-12 20:55:04,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:04,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856842413] [2024-10-12 20:55:04,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:04,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:04,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:04,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:04,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:04,688 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-12 20:55:04,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:04,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856842413] [2024-10-12 20:55:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856842413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:04,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735289926] [2024-10-12 20:55:04,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:04,691 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-12 20:55:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:06,561 INFO L93 Difference]: Finished difference Result 4927 states and 8441 transitions. [2024-10-12 20:55:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:55:06,562 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-12 20:55:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:06,581 INFO L225 Difference]: With dead ends: 4927 [2024-10-12 20:55:06,581 INFO L226 Difference]: Without dead ends: 4148 [2024-10-12 20:55:06,585 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-12 20:55:06,586 INFO L432 NwaCegarLoop]: 4240 mSDtfsCounter, 4734 mSDsluCounter, 16733 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:06,587 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.4s Time] [2024-10-12 20:55:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2024-10-12 20:55:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 3681. [2024-10-12 20:55:06,779 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-12 20:55:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6416 transitions. [2024-10-12 20:55:06,802 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6416 transitions. Word has length 101 [2024-10-12 20:55:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:06,803 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 6416 transitions. [2024-10-12 20:55:06,804 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-12 20:55:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6416 transitions. [2024-10-12 20:55:06,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:06,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:06,809 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-12 20:55:06,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:55:06,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:06,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1918433120, now seen corresponding path program 1 times [2024-10-12 20:55:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210457500] [2024-10-12 20:55:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:07,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:07,023 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-12 20:55:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210457500] [2024-10-12 20:55:07,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210457500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:07,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:07,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:07,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650222740] [2024-10-12 20:55:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:07,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:07,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:07,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:07,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:07,026 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-12 20:55:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:09,188 INFO L93 Difference]: Finished difference Result 8286 states and 13806 transitions. [2024-10-12 20:55:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:55:09,189 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-12 20:55:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:09,219 INFO L225 Difference]: With dead ends: 8286 [2024-10-12 20:55:09,219 INFO L226 Difference]: Without dead ends: 6740 [2024-10-12 20:55:09,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:55:09,229 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4964 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 20963 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:09,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4984 Valid, 20963 Invalid, 2108 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:55:09,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2024-10-12 20:55:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 5206. [2024-10-12 20:55:09,569 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-12 20:55:09,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5206 states to 5206 states and 8834 transitions. [2024-10-12 20:55:09,591 INFO L78 Accepts]: Start accepts. Automaton has 5206 states and 8834 transitions. Word has length 101 [2024-10-12 20:55:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:09,591 INFO L471 AbstractCegarLoop]: Abstraction has 5206 states and 8834 transitions. [2024-10-12 20:55:09,592 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-12 20:55:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5206 states and 8834 transitions. [2024-10-12 20:55:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:09,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:09,597 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-12 20:55:09,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:55:09,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:09,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2136294430, now seen corresponding path program 1 times [2024-10-12 20:55:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62047955] [2024-10-12 20:55:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:09,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:09,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:09,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:09,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:09,811 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-12 20:55:09,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:09,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62047955] [2024-10-12 20:55:09,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62047955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:09,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:09,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:09,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818147252] [2024-10-12 20:55:09,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:09,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:09,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:09,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:09,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:09,815 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-12 20:55:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:12,007 INFO L93 Difference]: Finished difference Result 13949 states and 22916 transitions. [2024-10-12 20:55:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:55:12,008 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-12 20:55:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:12,050 INFO L225 Difference]: With dead ends: 13949 [2024-10-12 20:55:12,050 INFO L226 Difference]: Without dead ends: 10878 [2024-10-12 20:55:12,065 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-12 20:55:12,066 INFO L432 NwaCegarLoop]: 4237 mSDtfsCounter, 4907 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:12,066 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.4s Time] [2024-10-12 20:55:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10878 states. [2024-10-12 20:55:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10878 to 8271. [2024-10-12 20:55:12,499 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-12 20:55:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8271 states to 8271 states and 13754 transitions. [2024-10-12 20:55:12,524 INFO L78 Accepts]: Start accepts. Automaton has 8271 states and 13754 transitions. Word has length 101 [2024-10-12 20:55:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:12,524 INFO L471 AbstractCegarLoop]: Abstraction has 8271 states and 13754 transitions. [2024-10-12 20:55:12,524 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-12 20:55:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8271 states and 13754 transitions. [2024-10-12 20:55:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:12,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:12,531 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-12 20:55:12,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:55:12,531 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2109228828, now seen corresponding path program 1 times [2024-10-12 20:55:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141933126] [2024-10-12 20:55:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:12,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:12,693 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-12 20:55:12,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:12,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141933126] [2024-10-12 20:55:12,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141933126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:12,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:12,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490108004] [2024-10-12 20:55:12,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:12,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:12,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:12,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:12,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:12,696 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-12 20:55:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:15,015 INFO L93 Difference]: Finished difference Result 25224 states and 41230 transitions. [2024-10-12 20:55:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:55:15,015 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-12 20:55:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:15,097 INFO L225 Difference]: With dead ends: 25224 [2024-10-12 20:55:15,097 INFO L226 Difference]: Without dead ends: 19088 [2024-10-12 20:55:15,130 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-12 20:55:15,131 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.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:15,131 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.2s Time] [2024-10-12 20:55:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19088 states. [2024-10-12 20:55:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19088 to 14401. [2024-10-12 20:55:16,163 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-12 20:55:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14401 states to 14401 states and 23756 transitions. [2024-10-12 20:55:16,208 INFO L78 Accepts]: Start accepts. Automaton has 14401 states and 23756 transitions. Word has length 101 [2024-10-12 20:55:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:16,208 INFO L471 AbstractCegarLoop]: Abstraction has 14401 states and 23756 transitions. [2024-10-12 20:55:16,208 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-12 20:55:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 14401 states and 23756 transitions. [2024-10-12 20:55:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:16,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:16,221 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-12 20:55:16,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:55:16,222 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:16,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:16,223 INFO L85 PathProgramCache]: Analyzing trace with hash 108401570, now seen corresponding path program 1 times [2024-10-12 20:55:16,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:16,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868912730] [2024-10-12 20:55:16,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:16,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:16,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:16,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:16,391 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-12 20:55:16,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:16,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868912730] [2024-10-12 20:55:16,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868912730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:16,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:16,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298003756] [2024-10-12 20:55:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:16,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:16,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:16,393 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-12 20:55:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:19,904 INFO L93 Difference]: Finished difference Result 47294 states and 77674 transitions. [2024-10-12 20:55:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:55:19,904 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-12 20:55:19,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:20,061 INFO L225 Difference]: With dead ends: 47294 [2024-10-12 20:55:20,061 INFO L226 Difference]: Without dead ends: 35028 [2024-10-12 20:55:20,122 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-12 20:55:20,123 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-12 20:55:20,123 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-12 20:55:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35028 states. [2024-10-12 20:55:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35028 to 26661. [2024-10-12 20:55:21,851 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-12 20:55:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26661 states to 26661 states and 44246 transitions. [2024-10-12 20:55:21,949 INFO L78 Accepts]: Start accepts. Automaton has 26661 states and 44246 transitions. Word has length 101 [2024-10-12 20:55:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 26661 states and 44246 transitions. [2024-10-12 20:55:21,951 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-12 20:55:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 26661 states and 44246 transitions. [2024-10-12 20:55:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:21,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:21,971 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-12 20:55:21,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:55:21,972 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:21,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1842506020, now seen corresponding path program 1 times [2024-10-12 20:55:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743693895] [2024-10-12 20:55:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:22,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:22,121 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-12 20:55:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743693895] [2024-10-12 20:55:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743693895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:22,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856884631] [2024-10-12 20:55:22,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:22,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:22,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:22,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:22,123 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-12 20:55:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:27,185 INFO L93 Difference]: Finished difference Result 90474 states and 150842 transitions. [2024-10-12 20:55:27,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:55:27,185 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-12 20:55:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:27,461 INFO L225 Difference]: With dead ends: 90474 [2024-10-12 20:55:27,461 INFO L226 Difference]: Without dead ends: 65948 [2024-10-12 20:55:27,532 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-12 20:55:27,533 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4805 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:27,533 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.3s Time] [2024-10-12 20:55:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65948 states. [2024-10-12 20:55:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65948 to 51181. [2024-10-12 20:55:30,914 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-12 20:55:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51181 states to 51181 states and 86684 transitions. [2024-10-12 20:55:31,152 INFO L78 Accepts]: Start accepts. Automaton has 51181 states and 86684 transitions. Word has length 101 [2024-10-12 20:55:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:55:31,153 INFO L471 AbstractCegarLoop]: Abstraction has 51181 states and 86684 transitions. [2024-10-12 20:55:31,153 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-12 20:55:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 51181 states and 86684 transitions. [2024-10-12 20:55:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 20:55:31,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:55:31,198 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-12 20:55:31,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:55:31,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:55:31,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:55:31,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1565238430, now seen corresponding path program 1 times [2024-10-12 20:55:31,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:55:31,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274832731] [2024-10-12 20:55:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:55:31,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:55:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:55:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:31,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 20:55:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 20:55:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:31,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 20:55:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 20:55:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:55:31,371 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-12 20:55:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:55:31,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274832731] [2024-10-12 20:55:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274832731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:55:31,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:55:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:55:31,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064053656] [2024-10-12 20:55:31,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:55:31,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:55:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:55:31,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:55:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:55:31,375 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-12 20:55:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:55:40,629 INFO L93 Difference]: Finished difference Result 174914 states and 299682 transitions. [2024-10-12 20:55:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:55:40,630 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-12 20:55:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:55:41,215 INFO L225 Difference]: With dead ends: 174914 [2024-10-12 20:55:41,215 INFO L226 Difference]: Without dead ends: 125868 [2024-10-12 20:55:41,684 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-12 20:55:41,685 INFO L432 NwaCegarLoop]: 4235 mSDtfsCounter, 4756 mSDsluCounter, 16728 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:55:41,685 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.5s Time] [2024-10-12 20:55:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125868 states.