./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.15.cil.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.15.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4859a4cdb98a3caca502aed15b30b6d563e2037c3c786a209b1853d003f6e66c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:55:58,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:55:58,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:55:58,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:55:58,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:55:58,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:55:58,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:55:58,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:55:58,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:55:58,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:55:58,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:55:58,740 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:55:58,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:55:58,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:55:58,743 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:55:58,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:55:58,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:55:58,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:55:58,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:55:58,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:55:58,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:55:58,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:55:58,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:55:58,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:55:58,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:55:58,748 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:55:58,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:55:58,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:55:58,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:55:58,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:55:58,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:55:58,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:55:58,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:55:58,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:55:58,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:55:58,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:55:58,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:55:58,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:55:58,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:55:58,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:55:58,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:55:58,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:55:58,753 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 -> 4859a4cdb98a3caca502aed15b30b6d563e2037c3c786a209b1853d003f6e66c [2024-10-12 20:55:58,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:55:58,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:55:58,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:55:58,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:55:58,989 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:55:58,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.15.cil.c [2024-10-12 20:56:00,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:56:00,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:56:00,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.15.cil.c [2024-10-12 20:56:00,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ed9decf/f8e0817151b843cca088c63ca1b5f79e/FLAGb3f10a929 [2024-10-12 20:56:00,909 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77ed9decf/f8e0817151b843cca088c63ca1b5f79e [2024-10-12 20:56:00,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:56:00,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:56:00,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:56:00,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:56:00,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:56:00,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:56:00" (1/1) ... [2024-10-12 20:56:00,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd3733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:00, skipping insertion in model container [2024-10-12 20:56:00,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:56:00" (1/1) ... [2024-10-12 20:56:01,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:56:02,250 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.15.cil.c[378560,378573] [2024-10-12 20:56:02,271 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.15.cil.c[383339,383352] [2024-10-12 20:56:02,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:56:02,498 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:56:03,057 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.15.cil.c[378560,378573] [2024-10-12 20:56:03,062 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.15.cil.c[383339,383352] [2024-10-12 20:56:03,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:56:03,138 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:56:03,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03 WrapperNode [2024-10-12 20:56:03,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:56:03,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:56:03,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:56:03,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:56:03,145 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:56:03" (1/1) ... [2024-10-12 20:56:03,209 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:56:03" (1/1) ... [2024-10-12 20:56:03,587 INFO L138 Inliner]: procedures = 70, calls = 81, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 13297 [2024-10-12 20:56:03,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:56:03,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:56:03,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:56:03,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:56:03,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,705 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:56:03,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,836 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:56:03,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:56:03,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:56:03,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:56:03,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (1/1) ... [2024-10-12 20:56:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:56:03,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:56:04,000 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:56:04,051 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:56:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:56:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 20:56:04,106 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 20:56:04,106 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 20:56:04,107 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 20:56:04,107 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 20:56:04,108 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 20:56:04,108 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 20:56:04,108 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 20:56:04,108 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 20:56:04,108 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 20:56:04,108 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 20:56:04,108 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 20:56:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 20:56:04,109 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 20:56:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:56:04,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:56:04,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:56:04,217 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:56:04,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:56:10,709 INFO L? ?]: Removed 1765 outVars from TransFormulas that were not future-live. [2024-10-12 20:56:10,709 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:56:10,808 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:56:10,808 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-12 20:56:10,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:56:10 BoogieIcfgContainer [2024-10-12 20:56:10,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:56:10,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:56:10,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:56:10,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:56:10,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:56:00" (1/3) ... [2024-10-12 20:56:10,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c3af8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:56:10, skipping insertion in model container [2024-10-12 20:56:10,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:56:03" (2/3) ... [2024-10-12 20:56:10,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c3af8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:56:10, skipping insertion in model container [2024-10-12 20:56:10,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:56:10" (3/3) ... [2024-10-12 20:56:10,819 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.15.cil.c [2024-10-12 20:56:10,841 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:56:10,841 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:56:10,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:56:10,950 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;@91530b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:56:10,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:56:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 2500 states, 2461 states have (on average 1.8748476229175133) internal successors, (4614), 2466 states have internal predecessors, (4614), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 20:56:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:10,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:10,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:10,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:10,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1003702544, now seen corresponding path program 1 times [2024-10-12 20:56:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696130333] [2024-10-12 20:56:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:11,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:11,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:11,690 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:56:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696130333] [2024-10-12 20:56:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696130333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:11,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:56:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16699409] [2024-10-12 20:56:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:11,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:56:11,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:56:11,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:56:11,733 INFO L87 Difference]: Start difference. First operand has 2500 states, 2461 states have (on average 1.8748476229175133) internal successors, (4614), 2466 states have internal predecessors, (4614), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:13,710 INFO L93 Difference]: Finished difference Result 5133 states and 9582 transitions. [2024-10-12 20:56:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:56:13,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:13,733 INFO L225 Difference]: With dead ends: 5133 [2024-10-12 20:56:13,733 INFO L226 Difference]: Without dead ends: 2635 [2024-10-12 20:56:13,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:56:13,743 INFO L432 NwaCegarLoop]: 4283 mSDtfsCounter, 1058 mSDsluCounter, 12236 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 16519 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:13,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 16519 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:56:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-12 20:56:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2495. [2024-10-12 20:56:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2458 states have (on average 1.8356387306753459) internal successors, (4512), 2461 states have internal predecessors, (4512), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 20:56:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4568 transitions. [2024-10-12 20:56:13,866 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4568 transitions. Word has length 172 [2024-10-12 20:56:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:13,867 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 4568 transitions. [2024-10-12 20:56:13,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4568 transitions. [2024-10-12 20:56:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:13,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:13,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:13,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:56:13,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:13,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1502259346, now seen corresponding path program 1 times [2024-10-12 20:56:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:13,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718325183] [2024-10-12 20:56:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:13,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:14,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:14,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:14,094 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:56:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718325183] [2024-10-12 20:56:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718325183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 20:56:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934469855] [2024-10-12 20:56:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:14,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:56:14,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:14,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:56:14,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:56:14,103 INFO L87 Difference]: Start difference. First operand 2495 states and 4568 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:15,854 INFO L93 Difference]: Finished difference Result 2994 states and 5402 transitions. [2024-10-12 20:56:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 20:56:15,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:15,866 INFO L225 Difference]: With dead ends: 2994 [2024-10-12 20:56:15,866 INFO L226 Difference]: Without dead ends: 2635 [2024-10-12 20:56:15,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:56:15,869 INFO L432 NwaCegarLoop]: 4279 mSDtfsCounter, 1046 mSDsluCounter, 12227 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 16506 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:15,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 16506 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:56:15,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-12 20:56:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2495. [2024-10-12 20:56:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2458 states have (on average 1.8352318958502847) internal successors, (4511), 2461 states have internal predecessors, (4511), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 20:56:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 4567 transitions. [2024-10-12 20:56:15,923 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 4567 transitions. Word has length 172 [2024-10-12 20:56:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:15,924 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 4567 transitions. [2024-10-12 20:56:15,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 4567 transitions. [2024-10-12 20:56:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:15,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:15,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:15,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:56:15,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:15,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash 267212268, now seen corresponding path program 1 times [2024-10-12 20:56:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:15,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068543546] [2024-10-12 20:56:15,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:16,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:16,234 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:56:16,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068543546] [2024-10-12 20:56:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068543546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:56:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374179996] [2024-10-12 20:56:16,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:16,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 20:56:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:16,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 20:56:16,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 20:56:16,237 INFO L87 Difference]: Start difference. First operand 2495 states and 4567 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:19,037 INFO L93 Difference]: Finished difference Result 3506 states and 6263 transitions. [2024-10-12 20:56:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 20:56:19,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:19,048 INFO L225 Difference]: With dead ends: 3506 [2024-10-12 20:56:19,049 INFO L226 Difference]: Without dead ends: 3151 [2024-10-12 20:56:19,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:19,051 INFO L432 NwaCegarLoop]: 4245 mSDtfsCounter, 5554 mSDsluCounter, 12730 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5574 SdHoareTripleChecker+Valid, 16975 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:19,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5574 Valid, 16975 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 20:56:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2024-10-12 20:56:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2870. [2024-10-12 20:56:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2870 states, 2804 states have (on average 1.8131241084165477) internal successors, (5084), 2808 states have internal predecessors, (5084), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-12 20:56:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 5187 transitions. [2024-10-12 20:56:19,157 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 5187 transitions. Word has length 172 [2024-10-12 20:56:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:19,158 INFO L471 AbstractCegarLoop]: Abstraction has 2870 states and 5187 transitions. [2024-10-12 20:56:19,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 5187 transitions. [2024-10-12 20:56:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:19,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:19,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:19,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:56:19,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:19,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1272317544, now seen corresponding path program 1 times [2024-10-12 20:56:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:19,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274213430] [2024-10-12 20:56:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:19,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:19,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:19,441 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:56:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274213430] [2024-10-12 20:56:19,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274213430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081229036] [2024-10-12 20:56:19,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:19,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:19,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:19,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:19,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:19,445 INFO L87 Difference]: Start difference. First operand 2870 states and 5187 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:23,374 INFO L93 Difference]: Finished difference Result 4417 states and 7785 transitions. [2024-10-12 20:56:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:56:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:23,388 INFO L225 Difference]: With dead ends: 4417 [2024-10-12 20:56:23,388 INFO L226 Difference]: Without dead ends: 3687 [2024-10-12 20:56:23,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:56:23,393 INFO L432 NwaCegarLoop]: 4463 mSDtfsCounter, 5601 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5621 SdHoareTripleChecker+Valid, 21973 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:23,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5621 Valid, 21973 Invalid, 4079 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 20:56:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2024-10-12 20:56:23,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3216. [2024-10-12 20:56:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3121 states have (on average 1.793976289650753) internal successors, (5599), 3126 states have internal predecessors, (5599), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 20:56:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5748 transitions. [2024-10-12 20:56:23,551 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5748 transitions. Word has length 172 [2024-10-12 20:56:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:23,552 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5748 transitions. [2024-10-12 20:56:23,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5748 transitions. [2024-10-12 20:56:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:23,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:23,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:23,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:56:23,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:23,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1658179946, now seen corresponding path program 1 times [2024-10-12 20:56:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531119150] [2024-10-12 20:56:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:23,904 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:56:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531119150] [2024-10-12 20:56:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531119150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192242528] [2024-10-12 20:56:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:23,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:23,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:23,912 INFO L87 Difference]: Start difference. First operand 3216 states and 5748 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:25,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:25,587 INFO L93 Difference]: Finished difference Result 4781 states and 8390 transitions. [2024-10-12 20:56:25,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:56:25,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:25,599 INFO L225 Difference]: With dead ends: 4781 [2024-10-12 20:56:25,600 INFO L226 Difference]: Without dead ends: 3705 [2024-10-12 20:56:25,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:25,604 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5289 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5310 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:25,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5310 Valid, 16772 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:56:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2024-10-12 20:56:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3216. [2024-10-12 20:56:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3121 states have (on average 1.7930150592758731) internal successors, (5596), 3126 states have internal predecessors, (5596), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 20:56:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5745 transitions. [2024-10-12 20:56:25,697 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5745 transitions. Word has length 172 [2024-10-12 20:56:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:25,698 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5745 transitions. [2024-10-12 20:56:25,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5745 transitions. [2024-10-12 20:56:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:25,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:25,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:25,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:56:25,701 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:25,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash -705661716, now seen corresponding path program 1 times [2024-10-12 20:56:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601687083] [2024-10-12 20:56:25,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:25,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:25,937 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:56:25,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:25,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601687083] [2024-10-12 20:56:25,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601687083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:25,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:25,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:25,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825047104] [2024-10-12 20:56:25,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:25,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:25,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:25,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:25,941 INFO L87 Difference]: Start difference. First operand 3216 states and 5745 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:27,554 INFO L93 Difference]: Finished difference Result 4777 states and 8373 transitions. [2024-10-12 20:56:27,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:56:27,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:27,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:27,568 INFO L225 Difference]: With dead ends: 4777 [2024-10-12 20:56:27,568 INFO L226 Difference]: Without dead ends: 3701 [2024-10-12 20:56:27,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:27,574 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5287 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5308 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:27,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5308 Valid, 16772 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:56:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3701 states. [2024-10-12 20:56:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3701 to 3216. [2024-10-12 20:56:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3121 states have (on average 1.7920538289009933) internal successors, (5593), 3126 states have internal predecessors, (5593), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 20:56:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5742 transitions. [2024-10-12 20:56:27,671 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5742 transitions. Word has length 172 [2024-10-12 20:56:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:27,671 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5742 transitions. [2024-10-12 20:56:27,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5742 transitions. [2024-10-12 20:56:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:27,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:27,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:27,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:56:27,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:27,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2028840662, now seen corresponding path program 1 times [2024-10-12 20:56:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:27,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171315073] [2024-10-12 20:56:27,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:27,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:27,963 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:56:27,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171315073] [2024-10-12 20:56:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171315073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:27,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:27,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561650846] [2024-10-12 20:56:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:27,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:27,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:27,965 INFO L87 Difference]: Start difference. First operand 3216 states and 5742 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:29,450 INFO L93 Difference]: Finished difference Result 4773 states and 8356 transitions. [2024-10-12 20:56:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:56:29,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:29,465 INFO L225 Difference]: With dead ends: 4773 [2024-10-12 20:56:29,465 INFO L226 Difference]: Without dead ends: 3697 [2024-10-12 20:56:29,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:29,470 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5285 mSDsluCounter, 12540 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5306 SdHoareTripleChecker+Valid, 16772 SdHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:29,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5306 Valid, 16772 Invalid, 1923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:56:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2024-10-12 20:56:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3216. [2024-10-12 20:56:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3121 states have (on average 1.7910925985261135) internal successors, (5590), 3126 states have internal predecessors, (5590), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 20:56:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 5739 transitions. [2024-10-12 20:56:29,555 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 5739 transitions. Word has length 172 [2024-10-12 20:56:29,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:29,555 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 5739 transitions. [2024-10-12 20:56:29,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 5739 transitions. [2024-10-12 20:56:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:29,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:29,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:29,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:56:29,558 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:29,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash -131861204, now seen corresponding path program 1 times [2024-10-12 20:56:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:29,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331702901] [2024-10-12 20:56:29,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:29,802 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:56:29,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:29,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331702901] [2024-10-12 20:56:29,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331702901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:29,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:29,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920917982] [2024-10-12 20:56:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:29,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:29,804 INFO L87 Difference]: Start difference. First operand 3216 states and 5739 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:32,781 INFO L93 Difference]: Finished difference Result 5739 states and 9934 transitions. [2024-10-12 20:56:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:56:32,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:32,803 INFO L225 Difference]: With dead ends: 5739 [2024-10-12 20:56:32,803 INFO L226 Difference]: Without dead ends: 4663 [2024-10-12 20:56:32,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:56:32,809 INFO L432 NwaCegarLoop]: 4254 mSDtfsCounter, 5686 mSDsluCounter, 16947 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5706 SdHoareTripleChecker+Valid, 21201 SdHoareTripleChecker+Invalid, 3374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:32,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5706 Valid, 21201 Invalid, 3374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 20:56:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2024-10-12 20:56:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 3921. [2024-10-12 20:56:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3768 states have (on average 1.7603503184713376) internal successors, (6633), 3775 states have internal predecessors, (6633), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 20:56:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 6878 transitions. [2024-10-12 20:56:32,931 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 6878 transitions. Word has length 172 [2024-10-12 20:56:32,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:32,932 INFO L471 AbstractCegarLoop]: Abstraction has 3921 states and 6878 transitions. [2024-10-12 20:56:32,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 6878 transitions. [2024-10-12 20:56:32,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:32,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:32,935 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:32,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:56:32,935 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:32,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash 206426346, now seen corresponding path program 1 times [2024-10-12 20:56:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931807951] [2024-10-12 20:56:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:33,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:33,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:33,169 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:56:33,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931807951] [2024-10-12 20:56:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931807951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:33,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:33,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678436337] [2024-10-12 20:56:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:33,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:33,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:33,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:33,172 INFO L87 Difference]: Start difference. First operand 3921 states and 6878 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:34,975 INFO L93 Difference]: Finished difference Result 6429 states and 11059 transitions. [2024-10-12 20:56:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:56:34,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:34,990 INFO L225 Difference]: With dead ends: 6429 [2024-10-12 20:56:34,990 INFO L226 Difference]: Without dead ends: 4648 [2024-10-12 20:56:34,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:34,999 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5120 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5141 SdHoareTripleChecker+Valid, 20907 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:34,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5141 Valid, 20907 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:56:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2024-10-12 20:56:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 3921. [2024-10-12 20:56:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3921 states, 3768 states have (on average 1.7590233545647558) internal successors, (6628), 3775 states have internal predecessors, (6628), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 20:56:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 6873 transitions. [2024-10-12 20:56:35,137 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 6873 transitions. Word has length 172 [2024-10-12 20:56:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:35,138 INFO L471 AbstractCegarLoop]: Abstraction has 3921 states and 6873 transitions. [2024-10-12 20:56:35,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 6873 transitions. [2024-10-12 20:56:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:35,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:35,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:35,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:56:35,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:35,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash 632980844, now seen corresponding path program 1 times [2024-10-12 20:56:35,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:35,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813082838] [2024-10-12 20:56:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:35,504 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:56:35,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:35,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813082838] [2024-10-12 20:56:35,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813082838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:35,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:35,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:35,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784140944] [2024-10-12 20:56:35,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:35,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:35,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:35,507 INFO L87 Difference]: Start difference. First operand 3921 states and 6873 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:39,129 INFO L93 Difference]: Finished difference Result 8298 states and 14097 transitions. [2024-10-12 20:56:39,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:56:39,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:39,147 INFO L225 Difference]: With dead ends: 8298 [2024-10-12 20:56:39,147 INFO L226 Difference]: Without dead ends: 6517 [2024-10-12 20:56:39,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:56:39,155 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5566 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5586 SdHoareTripleChecker+Valid, 21971 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:39,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5586 Valid, 21971 Invalid, 3947 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 20:56:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6517 states. [2024-10-12 20:56:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6517 to 5331. [2024-10-12 20:56:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5062 states have (on average 1.7194784670090872) internal successors, (8704), 5073 states have internal predecessors, (8704), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-12 20:56:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 9147 transitions. [2024-10-12 20:56:39,346 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 9147 transitions. Word has length 172 [2024-10-12 20:56:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:39,346 INFO L471 AbstractCegarLoop]: Abstraction has 5331 states and 9147 transitions. [2024-10-12 20:56:39,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 9147 transitions. [2024-10-12 20:56:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:39,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:39,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:39,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:56:39,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:39,351 INFO L85 PathProgramCache]: Analyzing trace with hash 92551338, now seen corresponding path program 1 times [2024-10-12 20:56:39,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:39,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282192009] [2024-10-12 20:56:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:39,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:39,585 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:56:39,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:39,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282192009] [2024-10-12 20:56:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282192009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:39,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511284705] [2024-10-12 20:56:39,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:39,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:39,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:39,587 INFO L87 Difference]: Start difference. First operand 5331 states and 9147 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:43,086 INFO L93 Difference]: Finished difference Result 13422 states and 22477 transitions. [2024-10-12 20:56:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:56:43,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:43,114 INFO L225 Difference]: With dead ends: 13422 [2024-10-12 20:56:43,115 INFO L226 Difference]: Without dead ends: 10231 [2024-10-12 20:56:43,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:56:43,127 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5571 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5591 SdHoareTripleChecker+Valid, 21971 SdHoareTripleChecker+Invalid, 3929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:43,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5591 Valid, 21971 Invalid, 3929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3860 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:56:43,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10231 states. [2024-10-12 20:56:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10231 to 8156. [2024-10-12 20:56:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 7655 states have (on average 1.680209013716525) internal successors, (12862), 7674 states have internal predecessors, (12862), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 20:56:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13719 transitions. [2024-10-12 20:56:43,584 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13719 transitions. Word has length 172 [2024-10-12 20:56:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:43,585 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13719 transitions. [2024-10-12 20:56:43,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13719 transitions. [2024-10-12 20:56:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:43,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:43,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:43,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:56:43,591 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:43,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash -63429204, now seen corresponding path program 1 times [2024-10-12 20:56:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:43,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100502357] [2024-10-12 20:56:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:43,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:43,812 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:56:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100502357] [2024-10-12 20:56:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100502357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548768838] [2024-10-12 20:56:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:43,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:43,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:43,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:43,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:43,814 INFO L87 Difference]: Start difference. First operand 8156 states and 13719 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:45,701 INFO L93 Difference]: Finished difference Result 16319 states and 27264 transitions. [2024-10-12 20:56:45,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:56:45,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:45,729 INFO L225 Difference]: With dead ends: 16319 [2024-10-12 20:56:45,729 INFO L226 Difference]: Without dead ends: 10303 [2024-10-12 20:56:45,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:45,748 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5124 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5145 SdHoareTripleChecker+Valid, 20907 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:45,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5145 Valid, 20907 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:56:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10303 states. [2024-10-12 20:56:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10303 to 8156. [2024-10-12 20:56:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 7655 states have (on average 1.6779882429784454) internal successors, (12845), 7674 states have internal predecessors, (12845), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 20:56:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13702 transitions. [2024-10-12 20:56:46,163 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13702 transitions. Word has length 172 [2024-10-12 20:56:46,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:46,164 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13702 transitions. [2024-10-12 20:56:46,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13702 transitions. [2024-10-12 20:56:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:46,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:46,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:46,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:56:46,168 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:46,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1851299026, now seen corresponding path program 1 times [2024-10-12 20:56:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861411611] [2024-10-12 20:56:46,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:46,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:46,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:46,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:56:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:46,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861411611] [2024-10-12 20:56:46,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861411611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:46,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:46,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:46,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835906271] [2024-10-12 20:56:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:46,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:46,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:46,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:46,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:46,363 INFO L87 Difference]: Start difference. First operand 8156 states and 13702 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:48,296 INFO L93 Difference]: Finished difference Result 16301 states and 27177 transitions. [2024-10-12 20:56:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:56:48,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:48,324 INFO L225 Difference]: With dead ends: 16301 [2024-10-12 20:56:48,324 INFO L226 Difference]: Without dead ends: 10285 [2024-10-12 20:56:48,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:56:48,341 INFO L432 NwaCegarLoop]: 4232 mSDtfsCounter, 5122 mSDsluCounter, 16675 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5143 SdHoareTripleChecker+Valid, 20907 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:48,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5143 Valid, 20907 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:56:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10285 states. [2024-10-12 20:56:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10285 to 8156. [2024-10-12 20:56:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 7655 states have (on average 1.6757674722403657) internal successors, (12828), 7674 states have internal predecessors, (12828), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 20:56:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 13685 transitions. [2024-10-12 20:56:48,869 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 13685 transitions. Word has length 172 [2024-10-12 20:56:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:48,870 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 13685 transitions. [2024-10-12 20:56:48,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 13685 transitions. [2024-10-12 20:56:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:48,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:48,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:48,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:56:48,877 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:48,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 307785068, now seen corresponding path program 1 times [2024-10-12 20:56:48,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:48,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583434952] [2024-10-12 20:56:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:49,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:49,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:56:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583434952] [2024-10-12 20:56:49,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583434952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:49,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:49,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850005527] [2024-10-12 20:56:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:49,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:49,124 INFO L87 Difference]: Start difference. First operand 8156 states and 13685 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:53,205 INFO L93 Difference]: Finished difference Result 23615 states and 39019 transitions. [2024-10-12 20:56:53,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:56:53,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:53,254 INFO L225 Difference]: With dead ends: 23615 [2024-10-12 20:56:53,255 INFO L226 Difference]: Without dead ends: 17599 [2024-10-12 20:56:53,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 20:56:53,274 INFO L432 NwaCegarLoop]: 4461 mSDtfsCounter, 5552 mSDsluCounter, 17510 mSDsCounter, 0 mSdLazyCounter, 3783 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5572 SdHoareTripleChecker+Valid, 21971 SdHoareTripleChecker+Invalid, 3852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:53,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5572 Valid, 21971 Invalid, 3852 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 3783 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:56:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17599 states. [2024-10-12 20:56:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17599 to 13872. [2024-10-12 20:56:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13872 states, 12907 states have (on average 1.642829472379329) internal successors, (21204), 12942 states have internal predecessors, (21204), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-12 20:56:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13872 states to 13872 states and 22943 transitions. [2024-10-12 20:56:53,966 INFO L78 Accepts]: Start accepts. Automaton has 13872 states and 22943 transitions. Word has length 172 [2024-10-12 20:56:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:56:53,967 INFO L471 AbstractCegarLoop]: Abstraction has 13872 states and 22943 transitions. [2024-10-12 20:56:53,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13872 states and 22943 transitions. [2024-10-12 20:56:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:56:53,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:56:53,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:53,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:56:53,977 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:56:53,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:56:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 377432942, now seen corresponding path program 1 times [2024-10-12 20:56:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:56:53,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201210688] [2024-10-12 20:56:53,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:56:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:56:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:56:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:54,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:56:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:56:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:54,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:56:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:54,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:56:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:56:54,215 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:56:54,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:56:54,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201210688] [2024-10-12 20:56:54,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201210688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:56:54,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:56:54,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:56:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918130165] [2024-10-12 20:56:54,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:56:54,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:56:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:56:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:56:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:56:54,217 INFO L87 Difference]: Start difference. First operand 13872 states and 22943 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:56:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:56:58,930 INFO L93 Difference]: Finished difference Result 49361 states and 81209 transitions. [2024-10-12 20:56:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:56:58,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:56:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:56:59,048 INFO L225 Difference]: With dead ends: 49361 [2024-10-12 20:56:59,048 INFO L226 Difference]: Without dead ends: 37629 [2024-10-12 20:56:59,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:56:59,082 INFO L432 NwaCegarLoop]: 4256 mSDtfsCounter, 6118 mSDsluCounter, 16945 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6152 SdHoareTripleChecker+Valid, 21201 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:56:59,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6152 Valid, 21201 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3169 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:56:59,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37629 states. [2024-10-12 20:57:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37629 to 25265. [2024-10-12 20:57:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25265 states, 23404 states have (on average 1.6218595111946676) internal successors, (37958), 23471 states have internal predecessors, (37958), 1405 states have call successors, (1405), 391 states have call predecessors, (1405), 454 states have return successors, (2196), 1466 states have call predecessors, (2196), 1403 states have call successors, (2196) [2024-10-12 20:57:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25265 states to 25265 states and 41559 transitions. [2024-10-12 20:57:00,504 INFO L78 Accepts]: Start accepts. Automaton has 25265 states and 41559 transitions. Word has length 172 [2024-10-12 20:57:00,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:00,504 INFO L471 AbstractCegarLoop]: Abstraction has 25265 states and 41559 transitions. [2024-10-12 20:57:00,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 25265 states and 41559 transitions. [2024-10-12 20:57:00,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:57:00,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:00,517 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:57:00,517 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:00,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash 795321644, now seen corresponding path program 1 times [2024-10-12 20:57:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:00,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347226389] [2024-10-12 20:57:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:57:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:00,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:57:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:57:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:00,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:57:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:00,732 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:57:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:00,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347226389] [2024-10-12 20:57:00,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347226389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401648743] [2024-10-12 20:57:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:00,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:00,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:00,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:00,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:00,735 INFO L87 Difference]: Start difference. First operand 25265 states and 41559 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:57:07,937 INFO L93 Difference]: Finished difference Result 94704 states and 156191 transitions. [2024-10-12 20:57:07,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:57:07,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 20:57:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:57:08,135 INFO L225 Difference]: With dead ends: 94704 [2024-10-12 20:57:08,135 INFO L226 Difference]: Without dead ends: 71579 [2024-10-12 20:57:08,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:57:08,195 INFO L432 NwaCegarLoop]: 4458 mSDtfsCounter, 5659 mSDsluCounter, 17502 mSDsCounter, 0 mSdLazyCounter, 4479 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5678 SdHoareTripleChecker+Valid, 21960 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:57:08,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5678 Valid, 21960 Invalid, 4550 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [71 Valid, 4479 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 20:57:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71579 states. [2024-10-12 20:57:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71579 to 47538. [2024-10-12 20:57:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47538 states, 43917 states have (on average 1.6083065783181911) internal successors, (70632), 44048 states have internal predecessors, (70632), 2717 states have call successors, (2717), 775 states have call predecessors, (2717), 902 states have return successors, (5030), 2842 states have call predecessors, (5030), 2715 states have call successors, (5030) [2024-10-12 20:57:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47538 states to 47538 states and 78379 transitions. [2024-10-12 20:57:11,289 INFO L78 Accepts]: Start accepts. Automaton has 47538 states and 78379 transitions. Word has length 172 [2024-10-12 20:57:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:57:11,290 INFO L471 AbstractCegarLoop]: Abstraction has 47538 states and 78379 transitions. [2024-10-12 20:57:11,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 20:57:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 47538 states and 78379 transitions. [2024-10-12 20:57:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 20:57:11,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:57:11,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:11,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:57:11,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:57:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:57:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2100692050, now seen corresponding path program 1 times [2024-10-12 20:57:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:57:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538020550] [2024-10-12 20:57:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:57:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:57:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:11,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 20:57:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:11,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 20:57:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 20:57:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:11,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 20:57:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 20:57:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:57:11,783 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:57:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:57:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538020550] [2024-10-12 20:57:11,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538020550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:57:11,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:57:11,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:57:11,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114553768] [2024-10-12 20:57:11,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:57:11,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:57:11,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:57:11,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:57:11,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:57:11,785 INFO L87 Difference]: Start difference. First operand 47538 states and 78379 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)