./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:53:38,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:53:38,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:53:38,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:53:38,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:53:38,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:53:38,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:53:38,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:53:38,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:53:38,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:53:38,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:53:38,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:53:38,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:53:38,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:53:38,463 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:53:38,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:53:38,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:53:38,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:53:38,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:53:38,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:53:38,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:53:38,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:53:38,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:53:38,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:53:38,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:53:38,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:53:38,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:53:38,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:53:38,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:53:38,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:53:38,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:53:38,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:53:38,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:53:38,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:53:38,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:53:38,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:53:38,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:53:38,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:53:38,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:53:38,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:53:38,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:53:38,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:53:38,473 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 -> fee2fbeec3a60e447cd74345d2f8a46dc28fcea89eab2880c2a2ccd5802bfaa0 [2024-11-11 22:53:38,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:53:38,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:53:38,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:53:38,728 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:53:38,728 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:53:38,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-11-11 22:53:39,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:53:40,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:53:40,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-11-11 22:53:40,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa52a4f9/5a0a5cb4b31b41ebad1ecfcb4066df1c/FLAG59bc3564f [2024-11-11 22:53:40,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa52a4f9/5a0a5cb4b31b41ebad1ecfcb4066df1c [2024-11-11 22:53:40,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:53:40,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:53:40,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:53:40,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:53:40,471 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:53:40,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,472 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79b1878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40, skipping insertion in model container [2024-11-11 22:53:40,472 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:53:40,653 WARN L250 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/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[913,926] [2024-11-11 22:53:40,700 WARN L250 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/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[5977,5990] [2024-11-11 22:53:40,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:53:40,777 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:53:40,788 WARN L250 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/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[913,926] [2024-11-11 22:53:40,805 WARN L250 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/pc_sfifo_1.cil-2+token_ring.06.cil-2.c[5977,5990] [2024-11-11 22:53:40,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:53:40,854 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:53:40,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40 WrapperNode [2024-11-11 22:53:40,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:53:40,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:53:40,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:53:40,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:53:40,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,918 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 723 [2024-11-11 22:53:40,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:53:40,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:53:40,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:53:40,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:53:40,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,959 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-11-11 22:53:40,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:53:40,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:53:40,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:53:40,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:53:40,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (1/1) ... [2024-11-11 22:53:40,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:53:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:41,017 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-11-11 22:53:41,019 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-11-11 22:53:41,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:53:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:53:41,061 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:53:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-11 22:53:41,062 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-11 22:53:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:53:41,062 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:53:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:53:41,062 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:53:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:53:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:53:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:53:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:53:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:53:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:53:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:53:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:53:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:53:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:53:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:53:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:53:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:53:41,181 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:53:41,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:53:41,738 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-11-11 22:53:41,739 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:53:41,755 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:53:41,755 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-11 22:53:41,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:53:41 BoogieIcfgContainer [2024-11-11 22:53:41,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:53:41,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:53:41,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:53:41,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:53:41,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:53:40" (1/3) ... [2024-11-11 22:53:41,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333dda95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:53:41, skipping insertion in model container [2024-11-11 22:53:41,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:53:40" (2/3) ... [2024-11-11 22:53:41,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333dda95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:53:41, skipping insertion in model container [2024-11-11 22:53:41,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:53:41" (3/3) ... [2024-11-11 22:53:41,762 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.06.cil-2.c [2024-11-11 22:53:41,775 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:53:41,775 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:53:41,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:53:41,846 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;@75200a91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:53:41,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:53:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 311 states, 273 states have (on average 1.6007326007326008) internal successors, (437), 278 states have internal predecessors, (437), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 22:53:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-11 22:53:41,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:41,857 INFO L218 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] [2024-11-11 22:53:41,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:41,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1020117344, now seen corresponding path program 1 times [2024-11-11 22:53:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103965053] [2024-11-11 22:53:41,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 22:53:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:42,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103965053] [2024-11-11 22:53:42,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103965053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:42,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:42,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:42,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276674999] [2024-11-11 22:53:42,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:42,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:42,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:42,203 INFO L87 Difference]: Start difference. First operand has 311 states, 273 states have (on average 1.6007326007326008) internal successors, (437), 278 states have internal predecessors, (437), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:42,677 INFO L93 Difference]: Finished difference Result 673 states and 1058 transitions. [2024-11-11 22:53:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:42,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2024-11-11 22:53:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:42,690 INFO L225 Difference]: With dead ends: 673 [2024-11-11 22:53:42,690 INFO L226 Difference]: Without dead ends: 371 [2024-11-11 22:53:42,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:42,696 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 590 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:42,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 623 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:53:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-11 22:53:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 365. [2024-11-11 22:53:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 322 states have (on average 1.4782608695652173) internal successors, (476), 326 states have internal predecessors, (476), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (34), 28 states have call predecessors, (34), 28 states have call successors, (34) [2024-11-11 22:53:42,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 540 transitions. [2024-11-11 22:53:42,750 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 540 transitions. Word has length 44 [2024-11-11 22:53:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:42,752 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 540 transitions. [2024-11-11 22:53:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 540 transitions. [2024-11-11 22:53:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:53:42,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:42,755 INFO L218 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] [2024-11-11 22:53:42,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:53:42,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:42,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash -300926777, now seen corresponding path program 1 times [2024-11-11 22:53:42,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496227256] [2024-11-11 22:53:42,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:53:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:42,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496227256] [2024-11-11 22:53:42,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496227256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:42,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:42,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:42,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965906225] [2024-11-11 22:53:42,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:42,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:42,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:42,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:42,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:42,862 INFO L87 Difference]: Start difference. First operand 365 states and 540 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:43,196 INFO L93 Difference]: Finished difference Result 613 states and 880 transitions. [2024-11-11 22:53:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 22:53:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:43,200 INFO L225 Difference]: With dead ends: 613 [2024-11-11 22:53:43,200 INFO L226 Difference]: Without dead ends: 489 [2024-11-11 22:53:43,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:43,204 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 249 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:43,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 835 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:53:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-11 22:53:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 432. [2024-11-11 22:53:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 383 states have (on average 1.4621409921671018) internal successors, (560), 387 states have internal predecessors, (560), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (37), 31 states have call predecessors, (37), 31 states have call successors, (37) [2024-11-11 22:53:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 630 transitions. [2024-11-11 22:53:43,230 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 630 transitions. Word has length 45 [2024-11-11 22:53:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:43,230 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 630 transitions. [2024-11-11 22:53:43,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 630 transitions. [2024-11-11 22:53:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-11 22:53:43,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:43,232 INFO L218 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] [2024-11-11 22:53:43,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:53:43,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:43,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1585284238, now seen corresponding path program 1 times [2024-11-11 22:53:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541960441] [2024-11-11 22:53:43,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-11 22:53:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541960441] [2024-11-11 22:53:43,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541960441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:43,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:43,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726683267] [2024-11-11 22:53:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:43,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:43,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:43,314 INFO L87 Difference]: Start difference. First operand 432 states and 630 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:43,576 INFO L93 Difference]: Finished difference Result 840 states and 1189 transitions. [2024-11-11 22:53:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2024-11-11 22:53:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:43,579 INFO L225 Difference]: With dead ends: 840 [2024-11-11 22:53:43,579 INFO L226 Difference]: Without dead ends: 649 [2024-11-11 22:53:43,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:43,584 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 600 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:43,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 617 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:53:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-11 22:53:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 597. [2024-11-11 22:53:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 529 states have (on average 1.4177693761814745) internal successors, (750), 536 states have internal predecessors, (750), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (54), 40 states have call predecessors, (54), 42 states have call successors, (54) [2024-11-11 22:53:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 848 transitions. [2024-11-11 22:53:43,628 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 848 transitions. Word has length 45 [2024-11-11 22:53:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 848 transitions. [2024-11-11 22:53:43,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 22:53:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 848 transitions. [2024-11-11 22:53:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 22:53:43,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:43,635 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:53:43,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:53:43,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:43,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2108015824, now seen corresponding path program 1 times [2024-11-11 22:53:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:43,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504235963] [2024-11-11 22:53:43,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:43,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-11 22:53:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:53:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:53:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:43,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504235963] [2024-11-11 22:53:43,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504235963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:43,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:43,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457067544] [2024-11-11 22:53:43,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:43,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:43,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:43,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:43,725 INFO L87 Difference]: Start difference. First operand 597 states and 848 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:53:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:44,036 INFO L93 Difference]: Finished difference Result 1181 states and 1633 transitions. [2024-11-11 22:53:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:44,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2024-11-11 22:53:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:44,043 INFO L225 Difference]: With dead ends: 1181 [2024-11-11 22:53:44,043 INFO L226 Difference]: Without dead ends: 825 [2024-11-11 22:53:44,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:44,044 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 233 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:44,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 885 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 22:53:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-11-11 22:53:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 787. [2024-11-11 22:53:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 695 states have (on average 1.3669064748201438) internal successors, (950), 704 states have internal predecessors, (950), 58 states have call successors, (58), 29 states have call predecessors, (58), 32 states have return successors, (78), 54 states have call predecessors, (78), 56 states have call successors, (78) [2024-11-11 22:53:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1086 transitions. [2024-11-11 22:53:44,073 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1086 transitions. Word has length 62 [2024-11-11 22:53:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:44,073 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1086 transitions. [2024-11-11 22:53:44,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:53:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1086 transitions. [2024-11-11 22:53:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-11 22:53:44,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:44,076 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:53:44,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:53:44,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:44,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1042963189, now seen corresponding path program 1 times [2024-11-11 22:53:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:44,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430249824] [2024-11-11 22:53:44,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:44,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 22:53:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 22:53:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:53:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430249824] [2024-11-11 22:53:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430249824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:44,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:44,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 22:53:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444818812] [2024-11-11 22:53:44,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:44,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:44,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:53:44,141 INFO L87 Difference]: Start difference. First operand 787 states and 1086 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:53:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:44,395 INFO L93 Difference]: Finished difference Result 1440 states and 1939 transitions. [2024-11-11 22:53:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:53:44,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2024-11-11 22:53:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:44,402 INFO L225 Difference]: With dead ends: 1440 [2024-11-11 22:53:44,402 INFO L226 Difference]: Without dead ends: 986 [2024-11-11 22:53:44,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:44,407 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 587 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:44,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 616 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:53:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-11-11 22:53:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 931. [2024-11-11 22:53:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 823 states have (on average 1.3377885783718104) internal successors, (1101), 834 states have internal predecessors, (1101), 66 states have call successors, (66), 35 states have call predecessors, (66), 40 states have return successors, (92), 62 states have call predecessors, (92), 64 states have call successors, (92) [2024-11-11 22:53:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1259 transitions. [2024-11-11 22:53:44,449 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1259 transitions. Word has length 67 [2024-11-11 22:53:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:44,450 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1259 transitions. [2024-11-11 22:53:44,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 22:53:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1259 transitions. [2024-11-11 22:53:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 22:53:44,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:44,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:53:44,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:53:44,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:44,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2053976574, now seen corresponding path program 1 times [2024-11-11 22:53:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:44,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635811164] [2024-11-11 22:53:44,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:53:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:53:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:53:44,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635811164] [2024-11-11 22:53:44,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635811164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:44,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448904527] [2024-11-11 22:53:44,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:44,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:44,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:44,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:53:44,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:53:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:44,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 22:53:44,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:53:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:44,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:53:44,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:53:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448904527] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 22:53:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-11 22:53:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207328819] [2024-11-11 22:53:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:44,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:53:44,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:44,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:53:44,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:53:44,789 INFO L87 Difference]: Start difference. First operand 931 states and 1259 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:53:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:44,903 INFO L93 Difference]: Finished difference Result 987 states and 1327 transitions. [2024-11-11 22:53:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:53:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2024-11-11 22:53:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:44,908 INFO L225 Difference]: With dead ends: 987 [2024-11-11 22:53:44,908 INFO L226 Difference]: Without dead ends: 984 [2024-11-11 22:53:44,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:53:44,909 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 805 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:44,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 540 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:53:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-11 22:53:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 930. [2024-11-11 22:53:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 823 states have (on average 1.3353584447144593) internal successors, (1099), 833 states have internal predecessors, (1099), 65 states have call successors, (65), 35 states have call predecessors, (65), 40 states have return successors, (92), 62 states have call predecessors, (92), 64 states have call successors, (92) [2024-11-11 22:53:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1256 transitions. [2024-11-11 22:53:44,950 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1256 transitions. Word has length 68 [2024-11-11 22:53:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:44,952 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1256 transitions. [2024-11-11 22:53:44,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 22:53:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1256 transitions. [2024-11-11 22:53:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 22:53:44,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:44,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:53:44,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:53:45,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 22:53:45,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:45,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash 750276014, now seen corresponding path program 1 times [2024-11-11 22:53:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:45,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858882252] [2024-11-11 22:53:45,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:45,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:53:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 22:53:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:53:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:45,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858882252] [2024-11-11 22:53:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858882252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:45,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078791317] [2024-11-11 22:53:45,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:45,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:45,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:45,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:53:45,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 22:53:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:45,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:53:45,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:53:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:45,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:53:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:53:45,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078791317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:53:45,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:53:45,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-11 22:53:45,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775224957] [2024-11-11 22:53:45,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:53:45,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 22:53:45,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:45,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 22:53:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:53:45,598 INFO L87 Difference]: Start difference. First operand 930 states and 1256 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:53:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:46,556 INFO L93 Difference]: Finished difference Result 2437 states and 3244 transitions. [2024-11-11 22:53:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:53:46,557 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-11 22:53:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:46,563 INFO L225 Difference]: With dead ends: 2437 [2024-11-11 22:53:46,564 INFO L226 Difference]: Without dead ends: 1893 [2024-11-11 22:53:46,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-11 22:53:46,567 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 769 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 2868 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:46,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 2868 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:53:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2024-11-11 22:53:46,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1293. [2024-11-11 22:53:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1147 states have (on average 1.3068875326939844) internal successors, (1499), 1165 states have internal predecessors, (1499), 85 states have call successors, (85), 49 states have call predecessors, (85), 59 states have return successors, (126), 79 states have call predecessors, (126), 84 states have call successors, (126) [2024-11-11 22:53:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1710 transitions. [2024-11-11 22:53:46,623 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1710 transitions. Word has length 69 [2024-11-11 22:53:46,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:46,623 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1710 transitions. [2024-11-11 22:53:46,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-11 22:53:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1710 transitions. [2024-11-11 22:53:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 22:53:46,626 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:46,626 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:53:46,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 22:53:46,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-11 22:53:46,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:46,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1614104128, now seen corresponding path program 1 times [2024-11-11 22:53:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:46,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655920648] [2024-11-11 22:53:46,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:53:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 22:53:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 22:53:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 22:53:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655920648] [2024-11-11 22:53:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655920648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073301468] [2024-11-11 22:53:46,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:46,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:46,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:46,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:53:46,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 22:53:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:46,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 22:53:46,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:53:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 22:53:47,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:53:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073301468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:47,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:53:47,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:53:47,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969173802] [2024-11-11 22:53:47,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:47,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:53:47,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:53:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:47,026 INFO L87 Difference]: Start difference. First operand 1293 states and 1710 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:53:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:47,065 INFO L93 Difference]: Finished difference Result 1990 states and 2614 transitions. [2024-11-11 22:53:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:53:47,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-11 22:53:47,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:47,070 INFO L225 Difference]: With dead ends: 1990 [2024-11-11 22:53:47,070 INFO L226 Difference]: Without dead ends: 1171 [2024-11-11 22:53:47,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:47,072 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 409 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:47,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 554 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:53:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-11-11 22:53:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1156. [2024-11-11 22:53:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1026 states have (on average 1.3070175438596492) internal successors, (1341), 1043 states have internal predecessors, (1341), 77 states have call successors, (77), 43 states have call predecessors, (77), 51 states have return successors, (112), 70 states have call predecessors, (112), 76 states have call successors, (112) [2024-11-11 22:53:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1530 transitions. [2024-11-11 22:53:47,126 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1530 transitions. Word has length 88 [2024-11-11 22:53:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:47,126 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1530 transitions. [2024-11-11 22:53:47,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 22:53:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1530 transitions. [2024-11-11 22:53:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 22:53:47,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:47,128 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:53:47,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 22:53:47,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:47,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:47,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:47,331 INFO L85 PathProgramCache]: Analyzing trace with hash -999731169, now seen corresponding path program 1 times [2024-11-11 22:53:47,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:47,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869519704] [2024-11-11 22:53:47,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:47,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:53:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 22:53:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 22:53:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 22:53:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 22:53:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 22:53:47,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869519704] [2024-11-11 22:53:47,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869519704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:53:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392305483] [2024-11-11 22:53:47,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:47,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:47,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:53:47,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:53:47,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 22:53:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 22:53:47,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:53:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-11 22:53:47,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 22:53:47,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392305483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:47,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 22:53:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-11 22:53:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59825133] [2024-11-11 22:53:47,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:47,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:53:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:53:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:47,544 INFO L87 Difference]: Start difference. First operand 1156 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 22:53:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:47,586 INFO L93 Difference]: Finished difference Result 1535 states and 1998 transitions. [2024-11-11 22:53:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:53:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2024-11-11 22:53:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:47,588 INFO L225 Difference]: With dead ends: 1535 [2024-11-11 22:53:47,588 INFO L226 Difference]: Without dead ends: 235 [2024-11-11 22:53:47,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:47,591 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 62 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:47,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 918 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:53:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-11 22:53:47,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-11 22:53:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 209 states have internal predecessors, (317), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-11 22:53:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 357 transitions. [2024-11-11 22:53:47,600 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 357 transitions. Word has length 103 [2024-11-11 22:53:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:47,600 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 357 transitions. [2024-11-11 22:53:47,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-11 22:53:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 357 transitions. [2024-11-11 22:53:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:53:47,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:47,601 INFO L218 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] [2024-11-11 22:53:47,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 22:53:47,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:53:47,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:47,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash -917328685, now seen corresponding path program 1 times [2024-11-11 22:53:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151935500] [2024-11-11 22:53:47,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:53:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:53:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:53:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:53:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:47,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:47,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151935500] [2024-11-11 22:53:47,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151935500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:47,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:47,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:53:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990072525] [2024-11-11 22:53:47,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:47,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:53:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:47,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:53:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:53:47,879 INFO L87 Difference]: Start difference. First operand 235 states and 357 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:48,513 INFO L93 Difference]: Finished difference Result 536 states and 830 transitions. [2024-11-11 22:53:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:53:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:53:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:48,515 INFO L225 Difference]: With dead ends: 536 [2024-11-11 22:53:48,515 INFO L226 Difference]: Without dead ends: 311 [2024-11-11 22:53:48,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:53:48,516 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 592 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:48,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 469 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:53:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-11 22:53:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 235. [2024-11-11 22:53:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.5192307692307692) internal successors, (316), 209 states have internal predecessors, (316), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-11 22:53:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 356 transitions. [2024-11-11 22:53:48,529 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 356 transitions. Word has length 112 [2024-11-11 22:53:48,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:48,529 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 356 transitions. [2024-11-11 22:53:48,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 356 transitions. [2024-11-11 22:53:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:53:48,531 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:48,531 INFO L218 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] [2024-11-11 22:53:48,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:53:48,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:48,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 389813713, now seen corresponding path program 1 times [2024-11-11 22:53:48,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:48,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418282505] [2024-11-11 22:53:48,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:48,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:53:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:53:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:53:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:53:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:48,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418282505] [2024-11-11 22:53:48,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418282505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:48,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:53:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888830089] [2024-11-11 22:53:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:53:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:53:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:53:48,679 INFO L87 Difference]: Start difference. First operand 235 states and 356 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:49,820 INFO L93 Difference]: Finished difference Result 833 states and 1297 transitions. [2024-11-11 22:53:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:53:49,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:53:49,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:49,823 INFO L225 Difference]: With dead ends: 833 [2024-11-11 22:53:49,823 INFO L226 Difference]: Without dead ends: 613 [2024-11-11 22:53:49,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:53:49,824 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 878 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:49,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 798 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 22:53:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-11 22:53:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 462. [2024-11-11 22:53:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 413 states have (on average 1.5326876513317191) internal successors, (633), 415 states have internal predecessors, (633), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-11-11 22:53:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 706 transitions. [2024-11-11 22:53:49,846 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 706 transitions. Word has length 112 [2024-11-11 22:53:49,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:49,847 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 706 transitions. [2024-11-11 22:53:49,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 706 transitions. [2024-11-11 22:53:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:53:49,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:49,848 INFO L218 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] [2024-11-11 22:53:49,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:53:49,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:49,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1741198931, now seen corresponding path program 1 times [2024-11-11 22:53:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077255800] [2024-11-11 22:53:49,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:49,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:53:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:49,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:53:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:53:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:53:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077255800] [2024-11-11 22:53:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077255800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:49,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:49,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948842747] [2024-11-11 22:53:49,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:49,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:49,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:49,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:49,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:49,991 INFO L87 Difference]: Start difference. First operand 462 states and 706 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:51,422 INFO L93 Difference]: Finished difference Result 1370 states and 2131 transitions. [2024-11-11 22:53:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:53:51,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:53:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:51,426 INFO L225 Difference]: With dead ends: 1370 [2024-11-11 22:53:51,426 INFO L226 Difference]: Without dead ends: 923 [2024-11-11 22:53:51,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:53:51,428 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 897 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:51,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1521 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:53:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2024-11-11 22:53:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 674. [2024-11-11 22:53:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 603 states have (on average 1.5257048092868988) internal successors, (920), 606 states have internal predecessors, (920), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-11 22:53:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1025 transitions. [2024-11-11 22:53:51,480 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1025 transitions. Word has length 112 [2024-11-11 22:53:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:51,481 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1025 transitions. [2024-11-11 22:53:51,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1025 transitions. [2024-11-11 22:53:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:53:51,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:51,482 INFO L218 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] [2024-11-11 22:53:51,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:53:51,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash 122224017, now seen corresponding path program 1 times [2024-11-11 22:53:51,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522032492] [2024-11-11 22:53:51,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:53:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:53:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:53:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:53:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:51,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522032492] [2024-11-11 22:53:51,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522032492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:51,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:51,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:51,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064186549] [2024-11-11 22:53:51,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:51,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:51,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:51,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:51,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:51,623 INFO L87 Difference]: Start difference. First operand 674 states and 1025 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:52,964 INFO L93 Difference]: Finished difference Result 2160 states and 3352 transitions. [2024-11-11 22:53:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:53:52,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:53:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:52,970 INFO L225 Difference]: With dead ends: 2160 [2024-11-11 22:53:52,970 INFO L226 Difference]: Without dead ends: 1501 [2024-11-11 22:53:52,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:53:52,973 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 891 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:52,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1519 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:53:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-11 22:53:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1102. [2024-11-11 22:53:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 987 states have (on average 1.5207700101317123) internal successors, (1501), 992 states have internal predecessors, (1501), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-11-11 22:53:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1674 transitions. [2024-11-11 22:53:53,042 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1674 transitions. Word has length 112 [2024-11-11 22:53:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:53,042 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1674 transitions. [2024-11-11 22:53:53,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:53,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1674 transitions. [2024-11-11 22:53:53,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:53:53,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:53,043 INFO L218 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] [2024-11-11 22:53:53,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:53:53,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:53,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:53,044 INFO L85 PathProgramCache]: Analyzing trace with hash 93723727, now seen corresponding path program 1 times [2024-11-11 22:53:53,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:53,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294784242] [2024-11-11 22:53:53,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:53,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:53:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:53:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:53,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:53:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:53:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:53,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294784242] [2024-11-11 22:53:53,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294784242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:53,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:53,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940838984] [2024-11-11 22:53:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:53,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:53,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:53,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:53,162 INFO L87 Difference]: Start difference. First operand 1102 states and 1674 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:54,594 INFO L93 Difference]: Finished difference Result 3690 states and 5705 transitions. [2024-11-11 22:53:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:53:54,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:53:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:54,604 INFO L225 Difference]: With dead ends: 3690 [2024-11-11 22:53:54,604 INFO L226 Difference]: Without dead ends: 2603 [2024-11-11 22:53:54,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:53:54,607 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 890 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:54,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1519 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:53:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2024-11-11 22:53:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1959. [2024-11-11 22:53:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1756 states have (on average 1.5165148063781322) internal successors, (2663), 1765 states have internal predecessors, (2663), 140 states have call successors, (140), 54 states have call predecessors, (140), 62 states have return successors, (175), 147 states have call predecessors, (175), 140 states have call successors, (175) [2024-11-11 22:53:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2978 transitions. [2024-11-11 22:53:54,729 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2978 transitions. Word has length 112 [2024-11-11 22:53:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:54,729 INFO L471 AbstractCegarLoop]: Abstraction has 1959 states and 2978 transitions. [2024-11-11 22:53:54,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2978 transitions. [2024-11-11 22:53:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:53:54,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:54,731 INFO L218 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] [2024-11-11 22:53:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:53:54,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1846858287, now seen corresponding path program 1 times [2024-11-11 22:53:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901005259] [2024-11-11 22:53:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:53:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:53:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:53:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:53:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901005259] [2024-11-11 22:53:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901005259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310811579] [2024-11-11 22:53:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:54,858 INFO L87 Difference]: Start difference. First operand 1959 states and 2978 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:56,357 INFO L93 Difference]: Finished difference Result 6749 states and 10427 transitions. [2024-11-11 22:53:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:53:56,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:53:56,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:56,373 INFO L225 Difference]: With dead ends: 6749 [2024-11-11 22:53:56,374 INFO L226 Difference]: Without dead ends: 4805 [2024-11-11 22:53:56,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:53:56,379 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 889 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1958 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:56,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1519 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1958 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:53:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2024-11-11 22:53:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 3680. [2024-11-11 22:53:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3301 states have (on average 1.5137837019085125) internal successors, (4997), 3318 states have internal predecessors, (4997), 260 states have call successors, (260), 102 states have call predecessors, (260), 118 states have return successors, (357), 275 states have call predecessors, (357), 260 states have call successors, (357) [2024-11-11 22:53:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5614 transitions. [2024-11-11 22:53:56,615 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5614 transitions. Word has length 112 [2024-11-11 22:53:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:56,615 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 5614 transitions. [2024-11-11 22:53:56,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5614 transitions. [2024-11-11 22:53:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:53:56,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:56,618 INFO L218 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] [2024-11-11 22:53:56,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:53:56,618 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:56,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:56,619 INFO L85 PathProgramCache]: Analyzing trace with hash 30204943, now seen corresponding path program 1 times [2024-11-11 22:53:56,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:56,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238937693] [2024-11-11 22:53:56,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:56,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:53:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:56,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:53:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:56,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:53:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:53:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:56,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:56,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238937693] [2024-11-11 22:53:56,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238937693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:56,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917655322] [2024-11-11 22:53:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:56,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:56,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:56,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:56,743 INFO L87 Difference]: Start difference. First operand 3680 states and 5614 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:53:58,438 INFO L93 Difference]: Finished difference Result 12868 states and 19933 transitions. [2024-11-11 22:53:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:53:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:53:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:53:58,465 INFO L225 Difference]: With dead ends: 12868 [2024-11-11 22:53:58,466 INFO L226 Difference]: Without dead ends: 9203 [2024-11-11 22:53:58,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:53:58,474 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 888 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:53:58,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1519 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:53:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9203 states. [2024-11-11 22:53:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9203 to 7137. [2024-11-11 22:53:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7137 states, 6406 states have (on average 1.5121760849203871) internal successors, (9687), 6439 states have internal predecessors, (9687), 500 states have call successors, (500), 198 states have call predecessors, (500), 230 states have return successors, (775), 531 states have call predecessors, (775), 500 states have call successors, (775) [2024-11-11 22:53:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 10962 transitions. [2024-11-11 22:53:58,861 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 10962 transitions. Word has length 112 [2024-11-11 22:53:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:53:58,862 INFO L471 AbstractCegarLoop]: Abstraction has 7137 states and 10962 transitions. [2024-11-11 22:53:58,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:53:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 10962 transitions. [2024-11-11 22:53:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:53:58,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:53:58,867 INFO L218 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] [2024-11-11 22:53:58,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:53:58,867 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:53:58,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:53:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash -740528623, now seen corresponding path program 1 times [2024-11-11 22:53:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:53:58,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741482471] [2024-11-11 22:53:58,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:53:58,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:53:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:58,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:53:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:58,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:53:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:58,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:53:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:58,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:53:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:58,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:53:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:53:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:53:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:53:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741482471] [2024-11-11 22:53:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741482471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:53:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:53:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:53:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705425287] [2024-11-11 22:53:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:53:58,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:53:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:53:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:53:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:53:58,978 INFO L87 Difference]: Start difference. First operand 7137 states and 10962 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:01,339 INFO L93 Difference]: Finished difference Result 28083 states and 43621 transitions. [2024-11-11 22:54:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:54:01,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:54:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:01,408 INFO L225 Difference]: With dead ends: 28083 [2024-11-11 22:54:01,409 INFO L226 Difference]: Without dead ends: 20961 [2024-11-11 22:54:01,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:54:01,431 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 950 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:01,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1509 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:54:01,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20961 states. [2024-11-11 22:54:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20961 to 13986. [2024-11-11 22:54:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13986 states, 12583 states have (on average 1.5138679170309148) internal successors, (19049), 12648 states have internal predecessors, (19049), 948 states have call successors, (948), 390 states have call predecessors, (948), 454 states have return successors, (1741), 1011 states have call predecessors, (1741), 948 states have call successors, (1741) [2024-11-11 22:54:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13986 states to 13986 states and 21738 transitions. [2024-11-11 22:54:02,539 INFO L78 Accepts]: Start accepts. Automaton has 13986 states and 21738 transitions. Word has length 112 [2024-11-11 22:54:02,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:02,540 INFO L471 AbstractCegarLoop]: Abstraction has 13986 states and 21738 transitions. [2024-11-11 22:54:02,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13986 states and 21738 transitions. [2024-11-11 22:54:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:54:02,548 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:02,548 INFO L218 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] [2024-11-11 22:54:02,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:54:02,549 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:02,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1735222321, now seen corresponding path program 1 times [2024-11-11 22:54:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:02,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333065818] [2024-11-11 22:54:02,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:02,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:54:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:02,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:54:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:54:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:02,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:54:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:02,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333065818] [2024-11-11 22:54:02,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333065818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:02,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:02,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106188758] [2024-11-11 22:54:02,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:02,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:02,661 INFO L87 Difference]: Start difference. First operand 13986 states and 21738 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:05,921 INFO L93 Difference]: Finished difference Result 54482 states and 85515 transitions. [2024-11-11 22:54:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:54:05,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:54:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:06,071 INFO L225 Difference]: With dead ends: 54482 [2024-11-11 22:54:06,072 INFO L226 Difference]: Without dead ends: 40511 [2024-11-11 22:54:06,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:54:06,127 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 1148 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:06,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1026 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:54:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40511 states. [2024-11-11 22:54:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40511 to 27331. [2024-11-11 22:54:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27331 states, 24616 states have (on average 1.5149090022749432) internal successors, (37291), 24745 states have internal predecessors, (37291), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 902 states have return successors, (4127), 1939 states have call predecessors, (4127), 1812 states have call successors, (4127) [2024-11-11 22:54:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27331 states to 27331 states and 43230 transitions. [2024-11-11 22:54:08,123 INFO L78 Accepts]: Start accepts. Automaton has 27331 states and 43230 transitions. Word has length 112 [2024-11-11 22:54:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:08,124 INFO L471 AbstractCegarLoop]: Abstraction has 27331 states and 43230 transitions. [2024-11-11 22:54:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 27331 states and 43230 transitions. [2024-11-11 22:54:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:54:08,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:08,139 INFO L218 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] [2024-11-11 22:54:08,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:54:08,139 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:08,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1973468753, now seen corresponding path program 1 times [2024-11-11 22:54:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420206297] [2024-11-11 22:54:08,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:54:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:54:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:08,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:54:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:08,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:54:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:08,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:08,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420206297] [2024-11-11 22:54:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420206297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:08,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:08,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:08,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55538081] [2024-11-11 22:54:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:08,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:08,252 INFO L87 Difference]: Start difference. First operand 27331 states and 43230 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:14,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:14,091 INFO L93 Difference]: Finished difference Result 105137 states and 167761 transitions. [2024-11-11 22:54:14,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:54:14,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:54:14,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:14,316 INFO L225 Difference]: With dead ends: 105137 [2024-11-11 22:54:14,316 INFO L226 Difference]: Without dead ends: 77821 [2024-11-11 22:54:14,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:54:14,382 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1065 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:14,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1509 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:54:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77821 states. [2024-11-11 22:54:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77821 to 54276. [2024-11-11 22:54:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54276 states, 49001 states have (on average 1.5172955653966245) internal successors, (74349), 49258 states have internal predecessors, (74349), 3476 states have call successors, (3476), 1542 states have call predecessors, (3476), 1798 states have return successors, (10293), 3731 states have call predecessors, (10293), 3476 states have call successors, (10293) [2024-11-11 22:54:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54276 states to 54276 states and 88118 transitions. [2024-11-11 22:54:18,558 INFO L78 Accepts]: Start accepts. Automaton has 54276 states and 88118 transitions. Word has length 112 [2024-11-11 22:54:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:18,559 INFO L471 AbstractCegarLoop]: Abstraction has 54276 states and 88118 transitions. [2024-11-11 22:54:18,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 54276 states and 88118 transitions. [2024-11-11 22:54:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:54:18,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:18,588 INFO L218 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] [2024-11-11 22:54:18,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:54:18,589 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:18,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash 14893967, now seen corresponding path program 1 times [2024-11-11 22:54:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:18,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156188047] [2024-11-11 22:54:18,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:54:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:54:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:54:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:54:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:18,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:54:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:54:18,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156188047] [2024-11-11 22:54:18,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156188047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:54:18,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:54:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:54:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747437616] [2024-11-11 22:54:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:54:18,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:54:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:54:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:54:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:54:18,708 INFO L87 Difference]: Start difference. First operand 54276 states and 88118 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:54:28,433 INFO L93 Difference]: Finished difference Result 201070 states and 330083 transitions. [2024-11-11 22:54:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:54:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2024-11-11 22:54:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:54:29,036 INFO L225 Difference]: With dead ends: 201070 [2024-11-11 22:54:29,036 INFO L226 Difference]: Without dead ends: 146809 [2024-11-11 22:54:29,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:54:29,353 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 982 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:54:29,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1509 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 22:54:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146809 states. [2024-11-11 22:54:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146809 to 108294. [2024-11-11 22:54:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108294 states, 98027 states have (on average 1.521060524141308) internal successors, (149105), 98540 states have internal predecessors, (149105), 6676 states have call successors, (6676), 3078 states have call predecessors, (6676), 3590 states have return successors, (26871), 7187 states have call predecessors, (26871), 6676 states have call successors, (26871) [2024-11-11 22:54:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108294 states to 108294 states and 182652 transitions. [2024-11-11 22:54:37,039 INFO L78 Accepts]: Start accepts. Automaton has 108294 states and 182652 transitions. Word has length 112 [2024-11-11 22:54:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:54:37,039 INFO L471 AbstractCegarLoop]: Abstraction has 108294 states and 182652 transitions. [2024-11-11 22:54:37,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:54:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 108294 states and 182652 transitions. [2024-11-11 22:54:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 22:54:37,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:54:37,107 INFO L218 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] [2024-11-11 22:54:37,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:54:37,108 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:54:37,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:54:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1864236979, now seen corresponding path program 1 times [2024-11-11 22:54:37,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:54:37,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166428549] [2024-11-11 22:54:37,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:54:37,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:54:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:54:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:54:37,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:54:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat