./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.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 2cb37d56f61ec273f723a733aad4526e011a3841f34b26767a03fdc541dd1ee3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:08:58,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:08:58,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:08:58,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:08:58,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:08:58,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:08:58,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:08:58,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:08:58,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:08:58,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:08:58,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:08:58,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:08:58,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:08:58,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:08:58,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:08:58,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:08:58,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:08:58,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:08:58,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:08:58,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:08:58,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:08:58,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:08:58,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:08:58,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:08:58,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:08:58,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:08:58,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:08:58,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:08:58,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:08:58,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:08:58,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:08:58,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:08:58,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:08:58,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:08:58,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:08:58,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:08:58,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:08:58,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:08:58,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:08:58,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:08:58,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:08:58,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:08:58,770 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 -> 2cb37d56f61ec273f723a733aad4526e011a3841f34b26767a03fdc541dd1ee3 [2024-11-20 00:08:59,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:08:59,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:08:59,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:08:59,076 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:08:59,077 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:08:59,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2024-11-20 00:09:00,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:09:00,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:09:00,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2024-11-20 00:09:00,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9705fc5d7/8ca66774b2aa4364a7566bbaf9c50237/FLAG3ebca0884 [2024-11-20 00:09:00,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9705fc5d7/8ca66774b2aa4364a7566bbaf9c50237 [2024-11-20 00:09:00,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:09:00,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:09:00,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:09:00,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:09:00,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:09:00,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:00" (1/1) ... [2024-11-20 00:09:00,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a6e76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:00, skipping insertion in model container [2024-11-20 00:09:00,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:09:00" (1/1) ... [2024-11-20 00:09:00,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:09:01,006 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_2.cil-1+token_ring.09.cil-1.c[914,927] [2024-11-20 00:09:01,079 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_2.cil-1+token_ring.09.cil-1.c[7115,7128] [2024-11-20 00:09:01,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:09:01,195 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:09:01,213 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_2.cil-1+token_ring.09.cil-1.c[914,927] [2024-11-20 00:09:01,236 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_2.cil-1+token_ring.09.cil-1.c[7115,7128] [2024-11-20 00:09:01,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:09:01,319 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:09:01,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01 WrapperNode [2024-11-20 00:09:01,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:09:01,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:09:01,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:09:01,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:09:01,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,406 INFO L138 Inliner]: procedures = 71, calls = 84, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 888 [2024-11-20 00:09:01,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:09:01,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:09:01,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:09:01,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:09:01,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,484 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-20 00:09:01,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,538 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:09:01,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:09:01,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:09:01,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:09:01,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (1/1) ... [2024-11-20 00:09:01,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:09:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:01,604 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-20 00:09:01,606 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-20 00:09:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:09:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:09:01,656 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:09:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:09:01,658 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:09:01,658 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:09:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:09:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:09:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:09:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:09:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:09:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:09:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:09:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:09:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:09:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:09:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:09:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:09:01,661 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:09:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:09:01,661 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:09:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:09:01,661 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:09:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:09:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:09:01,662 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:09:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:09:01,663 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:09:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:09:01,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:09:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:09:01,663 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:09:01,798 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:09:01,800 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:09:02,620 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-20 00:09:02,620 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:09:02,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:09:02,657 INFO L316 CfgBuilder]: Removed 16 assume(true) statements. [2024-11-20 00:09:02,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:02 BoogieIcfgContainer [2024-11-20 00:09:02,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:09:02,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:09:02,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:09:02,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:09:02,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:09:00" (1/3) ... [2024-11-20 00:09:02,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e65dc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:02, skipping insertion in model container [2024-11-20 00:09:02,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:09:01" (2/3) ... [2024-11-20 00:09:02,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e65dc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:09:02, skipping insertion in model container [2024-11-20 00:09:02,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:09:02" (3/3) ... [2024-11-20 00:09:02,668 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2024-11-20 00:09:02,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:09:02,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:09:02,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:09:02,775 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;@7ed97dc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:09:02,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:09:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 418 states, 364 states have (on average 1.60989010989011) internal successors, (586), 370 states have internal predecessors, (586), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 00:09:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:02,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:02,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:02,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:02,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1377141975, now seen corresponding path program 1 times [2024-11-20 00:09:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:02,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716508356] [2024-11-20 00:09:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:02,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,473 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-20 00:09:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:03,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716508356] [2024-11-20 00:09:03,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716508356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:03,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412954329] [2024-11-20 00:09:03,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:03,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:03,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:03,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:03,508 INFO L87 Difference]: Start difference. First operand has 418 states, 364 states have (on average 1.60989010989011) internal successors, (586), 370 states have internal predecessors, (586), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:09:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:04,902 INFO L93 Difference]: Finished difference Result 946 states and 1484 transitions. [2024-11-20 00:09:04,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:09:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-20 00:09:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:04,923 INFO L225 Difference]: With dead ends: 946 [2024-11-20 00:09:04,924 INFO L226 Difference]: Without dead ends: 543 [2024-11-20 00:09:04,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:09:04,937 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 743 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:04,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1831 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:09:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-20 00:09:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 504. [2024-11-20 00:09:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 432 states have (on average 1.4976851851851851) internal successors, (647), 438 states have internal predecessors, (647), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2024-11-20 00:09:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 746 transitions. [2024-11-20 00:09:05,060 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 746 transitions. Word has length 65 [2024-11-20 00:09:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:05,061 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 746 transitions. [2024-11-20 00:09:05,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:09:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 746 transitions. [2024-11-20 00:09:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:05,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:05,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:05,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:09:05,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:05,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:05,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1780927926, now seen corresponding path program 1 times [2024-11-20 00:09:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:05,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42932403] [2024-11-20 00:09:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:05,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:05,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:05,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:05,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:05,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:05,311 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-20 00:09:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:05,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42932403] [2024-11-20 00:09:05,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42932403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:05,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:05,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:05,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321142193] [2024-11-20 00:09:05,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:05,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:05,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:05,318 INFO L87 Difference]: Start difference. First operand 504 states and 746 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:09:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:06,664 INFO L93 Difference]: Finished difference Result 851 states and 1223 transitions. [2024-11-20 00:09:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:09:06,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-20 00:09:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:06,676 INFO L225 Difference]: With dead ends: 851 [2024-11-20 00:09:06,676 INFO L226 Difference]: Without dead ends: 674 [2024-11-20 00:09:06,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:09:06,679 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1214 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:06,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2064 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:09:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-20 00:09:06,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 600. [2024-11-20 00:09:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 508 states have (on average 1.4783464566929134) internal successors, (751), 516 states have internal predecessors, (751), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2024-11-20 00:09:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 880 transitions. [2024-11-20 00:09:06,735 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 880 transitions. Word has length 65 [2024-11-20 00:09:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:06,736 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 880 transitions. [2024-11-20 00:09:06,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:09:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 880 transitions. [2024-11-20 00:09:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:06,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:06,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:06,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:09:06,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:06,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash -247658184, now seen corresponding path program 1 times [2024-11-20 00:09:06,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:06,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456318320] [2024-11-20 00:09:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:06,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:06,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:06,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:06,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:06,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:06,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:06,973 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-20 00:09:06,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:06,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456318320] [2024-11-20 00:09:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456318320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:06,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:06,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:06,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224235835] [2024-11-20 00:09:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:06,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:06,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:06,976 INFO L87 Difference]: Start difference. First operand 600 states and 880 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:08,145 INFO L93 Difference]: Finished difference Result 899 states and 1291 transitions. [2024-11-20 00:09:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:09:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-20 00:09:08,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:08,151 INFO L225 Difference]: With dead ends: 899 [2024-11-20 00:09:08,151 INFO L226 Difference]: Without dead ends: 632 [2024-11-20 00:09:08,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:09:08,153 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 528 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2452 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:08,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2452 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:09:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-20 00:09:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 605. [2024-11-20 00:09:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 512 states have (on average 1.470703125) internal successors, (753), 520 states have internal predecessors, (753), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2024-11-20 00:09:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 883 transitions. [2024-11-20 00:09:08,196 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 883 transitions. Word has length 65 [2024-11-20 00:09:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:08,197 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 883 transitions. [2024-11-20 00:09:08,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 883 transitions. [2024-11-20 00:09:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:08,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:08,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:08,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:09:08,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:08,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1277017482, now seen corresponding path program 1 times [2024-11-20 00:09:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115862787] [2024-11-20 00:09:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,356 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-20 00:09:08,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:08,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115862787] [2024-11-20 00:09:08,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115862787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:08,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:08,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:08,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925539526] [2024-11-20 00:09:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:08,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:08,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:08,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:08,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:08,359 INFO L87 Difference]: Start difference. First operand 605 states and 883 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:09,464 INFO L93 Difference]: Finished difference Result 921 states and 1313 transitions. [2024-11-20 00:09:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:09:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-20 00:09:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:09,469 INFO L225 Difference]: With dead ends: 921 [2024-11-20 00:09:09,469 INFO L226 Difference]: Without dead ends: 649 [2024-11-20 00:09:09,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:09:09,472 INFO L432 NwaCegarLoop]: 352 mSDtfsCounter, 531 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:09,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2450 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:09:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-20 00:09:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 620. [2024-11-20 00:09:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 524 states have (on average 1.4599236641221374) internal successors, (765), 532 states have internal predecessors, (765), 59 states have call successors, (59), 28 states have call predecessors, (59), 35 states have return successors, (74), 63 states have call predecessors, (74), 57 states have call successors, (74) [2024-11-20 00:09:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 898 transitions. [2024-11-20 00:09:09,544 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 898 transitions. Word has length 65 [2024-11-20 00:09:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:09,545 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 898 transitions. [2024-11-20 00:09:09,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 898 transitions. [2024-11-20 00:09:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:09,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:09,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:09,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:09:09,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:09,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:09,549 INFO L85 PathProgramCache]: Analyzing trace with hash 109185912, now seen corresponding path program 1 times [2024-11-20 00:09:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:09,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268393480] [2024-11-20 00:09:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:09,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:09,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:09,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:09,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:09,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:09,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:09,748 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-20 00:09:09,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:09,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268393480] [2024-11-20 00:09:09,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268393480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:09,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:09,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:09,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080096532] [2024-11-20 00:09:09,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:09,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:09,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:09,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:09,751 INFO L87 Difference]: Start difference. First operand 620 states and 898 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:09:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:10,905 INFO L93 Difference]: Finished difference Result 1012 states and 1409 transitions. [2024-11-20 00:09:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:09:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-20 00:09:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:10,910 INFO L225 Difference]: With dead ends: 1012 [2024-11-20 00:09:10,911 INFO L226 Difference]: Without dead ends: 727 [2024-11-20 00:09:10,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:09:10,913 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 1495 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:10,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1555 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:09:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-20 00:09:10,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 632. [2024-11-20 00:09:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 534 states have (on average 1.451310861423221) internal successors, (775), 542 states have internal predecessors, (775), 60 states have call successors, (60), 29 states have call predecessors, (60), 36 states have return successors, (73), 64 states have call predecessors, (73), 58 states have call successors, (73) [2024-11-20 00:09:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 908 transitions. [2024-11-20 00:09:10,955 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 908 transitions. Word has length 65 [2024-11-20 00:09:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:10,956 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 908 transitions. [2024-11-20 00:09:10,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:09:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 908 transitions. [2024-11-20 00:09:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:09:10,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:10,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:10,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:09:10,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:10,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash -24827594, now seen corresponding path program 1 times [2024-11-20 00:09:10,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:10,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928870772] [2024-11-20 00:09:10,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:10,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,080 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-20 00:09:11,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:11,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928870772] [2024-11-20 00:09:11,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928870772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:11,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:11,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341203036] [2024-11-20 00:09:11,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:11,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:11,082 INFO L87 Difference]: Start difference. First operand 632 states and 908 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:09:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:11,809 INFO L93 Difference]: Finished difference Result 1274 states and 1755 transitions. [2024-11-20 00:09:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:09:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-20 00:09:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:11,815 INFO L225 Difference]: With dead ends: 1274 [2024-11-20 00:09:11,815 INFO L226 Difference]: Without dead ends: 978 [2024-11-20 00:09:11,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:09:11,819 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1774 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:11,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 943 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-20 00:09:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 922. [2024-11-20 00:09:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 758 states have (on average 1.4010554089709764) internal successors, (1062), 773 states have internal predecessors, (1062), 95 states have call successors, (95), 51 states have call predecessors, (95), 67 states have return successors, (130), 104 states have call predecessors, (130), 93 states have call successors, (130) [2024-11-20 00:09:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1287 transitions. [2024-11-20 00:09:11,877 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1287 transitions. Word has length 65 [2024-11-20 00:09:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:11,877 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1287 transitions. [2024-11-20 00:09:11,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:09:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1287 transitions. [2024-11-20 00:09:11,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:09:11,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:11,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:11,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:09:11,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:11,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:11,883 INFO L85 PathProgramCache]: Analyzing trace with hash -86912797, now seen corresponding path program 1 times [2024-11-20 00:09:11,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:11,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775248139] [2024-11-20 00:09:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:11,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:11,975 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-20 00:09:11,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:11,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775248139] [2024-11-20 00:09:11,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775248139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:11,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881556036] [2024-11-20 00:09:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:11,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:11,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:11,977 INFO L87 Difference]: Start difference. First operand 922 states and 1287 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:12,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:12,807 INFO L93 Difference]: Finished difference Result 2125 states and 2858 transitions. [2024-11-20 00:09:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:09:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-20 00:09:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:12,816 INFO L225 Difference]: With dead ends: 2125 [2024-11-20 00:09:12,816 INFO L226 Difference]: Without dead ends: 1518 [2024-11-20 00:09:12,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:09:12,821 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 721 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:12,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1465 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:09:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-20 00:09:12,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1403. [2024-11-20 00:09:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 1137 states have (on average 1.357080035180299) internal successors, (1543), 1155 states have internal predecessors, (1543), 140 states have call successors, (140), 95 states have call predecessors, (140), 124 states have return successors, (202), 159 states have call predecessors, (202), 138 states have call successors, (202) [2024-11-20 00:09:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1885 transitions. [2024-11-20 00:09:12,907 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1885 transitions. Word has length 66 [2024-11-20 00:09:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:12,908 INFO L471 AbstractCegarLoop]: Abstraction has 1403 states and 1885 transitions. [2024-11-20 00:09:12,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1885 transitions. [2024-11-20 00:09:12,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:09:12,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:12,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:12,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:09:12,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:12,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1371326862, now seen corresponding path program 1 times [2024-11-20 00:09:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:12,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843482651] [2024-11-20 00:09:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:12,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:12,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:12,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:13,001 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-20 00:09:13,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:13,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843482651] [2024-11-20 00:09:13,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843482651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:13,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:13,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:13,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423385651] [2024-11-20 00:09:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:13,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:13,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:13,003 INFO L87 Difference]: Start difference. First operand 1403 states and 1885 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:13,854 INFO L93 Difference]: Finished difference Result 3591 states and 4691 transitions. [2024-11-20 00:09:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:09:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-20 00:09:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:13,869 INFO L225 Difference]: With dead ends: 3591 [2024-11-20 00:09:13,869 INFO L226 Difference]: Without dead ends: 2523 [2024-11-20 00:09:13,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:09:13,874 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 1180 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:13,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 1226 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2024-11-20 00:09:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2265. [2024-11-20 00:09:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1803 states have (on average 1.3144758735440931) internal successors, (2370), 1831 states have internal predecessors, (2370), 238 states have call successors, (238), 179 states have call predecessors, (238), 222 states have return successors, (338), 261 states have call predecessors, (338), 236 states have call successors, (338) [2024-11-20 00:09:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2946 transitions. [2024-11-20 00:09:14,049 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2946 transitions. Word has length 66 [2024-11-20 00:09:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:14,050 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 2946 transitions. [2024-11-20 00:09:14,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2946 transitions. [2024-11-20 00:09:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-20 00:09:14,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:14,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:14,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:09:14,054 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1950224446, now seen corresponding path program 1 times [2024-11-20 00:09:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:14,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514000272] [2024-11-20 00:09:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:14,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:14,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:14,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:14,137 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-20 00:09:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514000272] [2024-11-20 00:09:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514000272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:14,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:14,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468109426] [2024-11-20 00:09:14,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:14,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:14,140 INFO L87 Difference]: Start difference. First operand 2265 states and 2946 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:14,979 INFO L93 Difference]: Finished difference Result 5175 states and 6596 transitions. [2024-11-20 00:09:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:09:14,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-20 00:09:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:14,997 INFO L225 Difference]: With dead ends: 5175 [2024-11-20 00:09:14,998 INFO L226 Difference]: Without dead ends: 3245 [2024-11-20 00:09:15,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:09:15,006 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1165 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:15,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1272 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2024-11-20 00:09:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2997. [2024-11-20 00:09:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2997 states, 2371 states have (on average 1.2964993673555463) internal successors, (3074), 2407 states have internal predecessors, (3074), 318 states have call successors, (318), 249 states have call predecessors, (318), 306 states have return successors, (447), 347 states have call predecessors, (447), 316 states have call successors, (447) [2024-11-20 00:09:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3839 transitions. [2024-11-20 00:09:15,263 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3839 transitions. Word has length 72 [2024-11-20 00:09:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:15,264 INFO L471 AbstractCegarLoop]: Abstraction has 2997 states and 3839 transitions. [2024-11-20 00:09:15,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:09:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3839 transitions. [2024-11-20 00:09:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 00:09:15,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:15,266 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 00:09:15,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash -844134956, now seen corresponding path program 1 times [2024-11-20 00:09:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889406266] [2024-11-20 00:09:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:15,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:15,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:15,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889406266] [2024-11-20 00:09:15,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889406266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:15,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:15,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:15,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042182744] [2024-11-20 00:09:15,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:15,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:15,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:15,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:15,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:15,374 INFO L87 Difference]: Start difference. First operand 2997 states and 3839 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 00:09:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:16,392 INFO L93 Difference]: Finished difference Result 3771 states and 4770 transitions. [2024-11-20 00:09:16,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:09:16,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-20 00:09:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:16,410 INFO L225 Difference]: With dead ends: 3771 [2024-11-20 00:09:16,410 INFO L226 Difference]: Without dead ends: 3768 [2024-11-20 00:09:16,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:09:16,413 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 2064 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2074 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:16,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2074 Valid, 960 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:09:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2024-11-20 00:09:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3491. [2024-11-20 00:09:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 2756 states have (on average 1.2866473149492017) internal successors, (3546), 2797 states have internal predecessors, (3546), 368 states have call successors, (368), 293 states have call predecessors, (368), 365 states have return successors, (526), 407 states have call predecessors, (526), 367 states have call successors, (526) [2024-11-20 00:09:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 4440 transitions. [2024-11-20 00:09:16,721 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 4440 transitions. Word has length 73 [2024-11-20 00:09:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:16,721 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 4440 transitions. [2024-11-20 00:09:16,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 00:09:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4440 transitions. [2024-11-20 00:09:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 00:09:16,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:16,724 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:16,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:09:16,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:16,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash -399603124, now seen corresponding path program 1 times [2024-11-20 00:09:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:16,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589076802] [2024-11-20 00:09:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:16,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:16,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:16,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:16,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:16,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:16,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589076802] [2024-11-20 00:09:16,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589076802] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:09:16,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060699981] [2024-11-20 00:09:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:16,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:16,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:16,907 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-20 00:09:16,908 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-20 00:09:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:17,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 00:09:17,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:09:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:17,283 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:09:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060699981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:09:17,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:09:17,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-20 00:09:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145848021] [2024-11-20 00:09:17,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:09:17,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 00:09:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:17,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 00:09:17,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:09:17,379 INFO L87 Difference]: Start difference. First operand 3491 states and 4440 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-20 00:09:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:19,536 INFO L93 Difference]: Finished difference Result 7932 states and 9926 transitions. [2024-11-20 00:09:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 00:09:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-20 00:09:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:19,579 INFO L225 Difference]: With dead ends: 7932 [2024-11-20 00:09:19,579 INFO L226 Difference]: Without dead ends: 7929 [2024-11-20 00:09:19,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-20 00:09:19,585 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 2269 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2338 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:19,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2338 Valid, 2173 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:09:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7929 states. [2024-11-20 00:09:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7929 to 5281. [2024-11-20 00:09:20,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5281 states, 4160 states have (on average 1.279326923076923) internal successors, (5322), 4223 states have internal predecessors, (5322), 552 states have call successors, (552), 451 states have call predecessors, (552), 567 states have return successors, (804), 613 states have call predecessors, (804), 551 states have call successors, (804) [2024-11-20 00:09:20,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5281 states to 5281 states and 6678 transitions. [2024-11-20 00:09:20,133 INFO L78 Accepts]: Start accepts. Automaton has 5281 states and 6678 transitions. Word has length 74 [2024-11-20 00:09:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:20,133 INFO L471 AbstractCegarLoop]: Abstraction has 5281 states and 6678 transitions. [2024-11-20 00:09:20,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-20 00:09:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5281 states and 6678 transitions. [2024-11-20 00:09:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 00:09:20,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:20,136 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:20,145 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-20 00:09:20,336 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,SelfDestructingSolverStorable10 [2024-11-20 00:09:20,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:20,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash -340320684, now seen corresponding path program 2 times [2024-11-20 00:09:20,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:20,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413468217] [2024-11-20 00:09:20,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:20,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413468217] [2024-11-20 00:09:20,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413468217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:20,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:20,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:20,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269349672] [2024-11-20 00:09:20,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:20,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:20,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:20,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:20,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:20,408 INFO L87 Difference]: Start difference. First operand 5281 states and 6678 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 00:09:21,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:21,299 INFO L93 Difference]: Finished difference Result 7963 states and 10051 transitions. [2024-11-20 00:09:21,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:09:21,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-20 00:09:21,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:21,319 INFO L225 Difference]: With dead ends: 7963 [2024-11-20 00:09:21,319 INFO L226 Difference]: Without dead ends: 3888 [2024-11-20 00:09:21,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:09:21,328 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 1345 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:21,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1051 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:09:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3888 states. [2024-11-20 00:09:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3888 to 3653. [2024-11-20 00:09:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3653 states, 2888 states have (on average 1.268005540166205) internal successors, (3662), 2929 states have internal predecessors, (3662), 384 states have call successors, (384), 307 states have call predecessors, (384), 379 states have return successors, (530), 423 states have call predecessors, (530), 383 states have call successors, (530) [2024-11-20 00:09:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 4576 transitions. [2024-11-20 00:09:21,750 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 4576 transitions. Word has length 77 [2024-11-20 00:09:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:21,751 INFO L471 AbstractCegarLoop]: Abstraction has 3653 states and 4576 transitions. [2024-11-20 00:09:21,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 00:09:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 4576 transitions. [2024-11-20 00:09:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 00:09:21,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:21,755 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:21,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:09:21,755 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:21,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:21,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1727990114, now seen corresponding path program 1 times [2024-11-20 00:09:21,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:21,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588512478] [2024-11-20 00:09:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:09:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:21,905 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-20 00:09:21,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:21,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588512478] [2024-11-20 00:09:21,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588512478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:21,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:21,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:09:21,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197755277] [2024-11-20 00:09:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:21,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:09:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:09:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:09:21,909 INFO L87 Difference]: Start difference. First operand 3653 states and 4576 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 00:09:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:23,484 INFO L93 Difference]: Finished difference Result 10525 states and 12993 transitions. [2024-11-20 00:09:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 00:09:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-20 00:09:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:23,558 INFO L225 Difference]: With dead ends: 10525 [2024-11-20 00:09:23,559 INFO L226 Difference]: Without dead ends: 5888 [2024-11-20 00:09:23,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-20 00:09:23,569 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 1254 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:23,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1602 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:09:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5888 states. [2024-11-20 00:09:24,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5888 to 5568. [2024-11-20 00:09:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5568 states, 4346 states have (on average 1.2390704095720202) internal successors, (5385), 4430 states have internal predecessors, (5385), 588 states have call successors, (588), 481 states have call predecessors, (588), 632 states have return successors, (912), 663 states have call predecessors, (912), 587 states have call successors, (912) [2024-11-20 00:09:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 6885 transitions. [2024-11-20 00:09:24,079 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 6885 transitions. Word has length 84 [2024-11-20 00:09:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:24,080 INFO L471 AbstractCegarLoop]: Abstraction has 5568 states and 6885 transitions. [2024-11-20 00:09:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 00:09:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 6885 transitions. [2024-11-20 00:09:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 00:09:24,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:24,084 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:24,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:09:24,084 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:24,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash 2143413234, now seen corresponding path program 1 times [2024-11-20 00:09:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:24,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329557055] [2024-11-20 00:09:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:09:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 00:09:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:24,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329557055] [2024-11-20 00:09:24,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329557055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:24,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:24,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:09:24,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36125861] [2024-11-20 00:09:24,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:24,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:09:24,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:24,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:09:24,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:24,227 INFO L87 Difference]: Start difference. First operand 5568 states and 6885 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 00:09:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:25,870 INFO L93 Difference]: Finished difference Result 9571 states and 11725 transitions. [2024-11-20 00:09:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 00:09:25,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-20 00:09:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:25,894 INFO L225 Difference]: With dead ends: 9571 [2024-11-20 00:09:25,894 INFO L226 Difference]: Without dead ends: 4978 [2024-11-20 00:09:25,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-20 00:09:25,906 INFO L432 NwaCegarLoop]: 357 mSDtfsCounter, 1778 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:25,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 1934 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:09:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2024-11-20 00:09:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4644. [2024-11-20 00:09:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4644 states, 3635 states have (on average 1.2335625859697386) internal successors, (4484), 3701 states have internal predecessors, (4484), 489 states have call successors, (489), 396 states have call predecessors, (489), 518 states have return successors, (690), 553 states have call predecessors, (690), 488 states have call successors, (690) [2024-11-20 00:09:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4644 states to 4644 states and 5663 transitions. [2024-11-20 00:09:26,438 INFO L78 Accepts]: Start accepts. Automaton has 4644 states and 5663 transitions. Word has length 93 [2024-11-20 00:09:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:26,439 INFO L471 AbstractCegarLoop]: Abstraction has 4644 states and 5663 transitions. [2024-11-20 00:09:26,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 00:09:26,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4644 states and 5663 transitions. [2024-11-20 00:09:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:26,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:26,446 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:09:26,447 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:26,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:26,447 INFO L85 PathProgramCache]: Analyzing trace with hash -524987056, now seen corresponding path program 1 times [2024-11-20 00:09:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616147941] [2024-11-20 00:09:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:26,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:09:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 00:09:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 00:09:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 00:09:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 00:09:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 00:09:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-20 00:09:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:26,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616147941] [2024-11-20 00:09:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616147941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:09:26,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729812580] [2024-11-20 00:09:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:09:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:09:26,652 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-20 00:09:26,654 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-20 00:09:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:26,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 00:09:26,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:09:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 00:09:26,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:09:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729812580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:09:26,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-20 00:09:26,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474085781] [2024-11-20 00:09:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:26,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:26,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:26,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:26,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:09:26,823 INFO L87 Difference]: Start difference. First operand 4644 states and 5663 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 00:09:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:26,999 INFO L93 Difference]: Finished difference Result 6685 states and 8110 transitions. [2024-11-20 00:09:26,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:09:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-20 00:09:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:27,011 INFO L225 Difference]: With dead ends: 6685 [2024-11-20 00:09:27,011 INFO L226 Difference]: Without dead ends: 2380 [2024-11-20 00:09:27,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:09:27,020 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 0 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3031 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:27,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3031 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:09:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-11-20 00:09:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2380. [2024-11-20 00:09:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 1948 states have (on average 1.2474332648870636) internal successors, (2430), 1963 states have internal predecessors, (2430), 213 states have call successors, (213), 162 states have call predecessors, (213), 217 states have return successors, (297), 255 states have call predecessors, (297), 212 states have call successors, (297) [2024-11-20 00:09:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 2940 transitions. [2024-11-20 00:09:27,202 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 2940 transitions. Word has length 145 [2024-11-20 00:09:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:27,203 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 2940 transitions. [2024-11-20 00:09:27,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 00:09:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 2940 transitions. [2024-11-20 00:09:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 00:09:27,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:27,207 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:27,217 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-20 00:09:27,411 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,SelfDestructingSolverStorable14 [2024-11-20 00:09:27,413 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:27,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1151640180, now seen corresponding path program 1 times [2024-11-20 00:09:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:27,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345296981] [2024-11-20 00:09:27,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:27,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:09:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:09:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:09:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:09:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:09:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 00:09:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 00:09:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 00:09:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:09:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:09:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 00:09:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 00:09:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 00:09:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-20 00:09:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:27,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345296981] [2024-11-20 00:09:27,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345296981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:27,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:27,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:27,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574790904] [2024-11-20 00:09:27,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:27,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:27,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:27,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:27,496 INFO L87 Difference]: Start difference. First operand 2380 states and 2940 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:09:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:28,123 INFO L93 Difference]: Finished difference Result 2445 states and 3008 transitions. [2024-11-20 00:09:28,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:09:28,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2024-11-20 00:09:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:28,133 INFO L225 Difference]: With dead ends: 2445 [2024-11-20 00:09:28,134 INFO L226 Difference]: Without dead ends: 2002 [2024-11-20 00:09:28,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:09:28,135 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 889 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:28,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1140 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:09:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-11-20 00:09:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1940. [2024-11-20 00:09:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1604 states have (on average 1.2630922693266833) internal successors, (2026), 1616 states have internal predecessors, (2026), 167 states have call successors, (167), 122 states have call predecessors, (167), 167 states have return successors, (233), 202 states have call predecessors, (233), 166 states have call successors, (233) [2024-11-20 00:09:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2426 transitions. [2024-11-20 00:09:28,294 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2426 transitions. Word has length 147 [2024-11-20 00:09:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:28,294 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 2426 transitions. [2024-11-20 00:09:28,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:09:28,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2426 transitions. [2024-11-20 00:09:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:28,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:28,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:28,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:09:28,299 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:28,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2014093114, now seen corresponding path program 1 times [2024-11-20 00:09:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034397195] [2024-11-20 00:09:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:28,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:28,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:28,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:28,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:28,450 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-20 00:09:28,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034397195] [2024-11-20 00:09:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034397195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:28,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:28,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:09:28,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988999858] [2024-11-20 00:09:28,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:28,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:09:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:28,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:09:28,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:09:28,453 INFO L87 Difference]: Start difference. First operand 1940 states and 2426 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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-20 00:09:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:29,942 INFO L93 Difference]: Finished difference Result 2353 states and 3084 transitions. [2024-11-20 00:09:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:09:29,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:29,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:29,952 INFO L225 Difference]: With dead ends: 2353 [2024-11-20 00:09:29,952 INFO L226 Difference]: Without dead ends: 2049 [2024-11-20 00:09:29,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:09:29,955 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 919 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:29,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 858 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:09:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2024-11-20 00:09:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1940. [2024-11-20 00:09:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1604 states have (on average 1.2624688279301746) internal successors, (2025), 1616 states have internal predecessors, (2025), 167 states have call successors, (167), 122 states have call predecessors, (167), 167 states have return successors, (233), 202 states have call predecessors, (233), 166 states have call successors, (233) [2024-11-20 00:09:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2425 transitions. [2024-11-20 00:09:30,248 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2425 transitions. Word has length 145 [2024-11-20 00:09:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:30,248 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 2425 transitions. [2024-11-20 00:09:30,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 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-20 00:09:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2425 transitions. [2024-11-20 00:09:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:30,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:30,252 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:30,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:09:30,253 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:30,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash 615139512, now seen corresponding path program 1 times [2024-11-20 00:09:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:30,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439592758] [2024-11-20 00:09:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:30,448 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-20 00:09:30,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:30,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439592758] [2024-11-20 00:09:30,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439592758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:30,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:30,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:09:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463755596] [2024-11-20 00:09:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:30,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:09:30,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:30,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:09:30,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:09:30,450 INFO L87 Difference]: Start difference. First operand 1940 states and 2425 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-20 00:09:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:32,892 INFO L93 Difference]: Finished difference Result 2760 states and 3732 transitions. [2024-11-20 00:09:32,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:09:32,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:32,905 INFO L225 Difference]: With dead ends: 2760 [2024-11-20 00:09:32,905 INFO L226 Difference]: Without dead ends: 2465 [2024-11-20 00:09:32,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:09:32,909 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1447 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:32,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1277 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 00:09:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-11-20 00:09:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2248. [2024-11-20 00:09:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1887 states have (on average 1.3078961314255433) internal successors, (2468), 1900 states have internal predecessors, (2468), 185 states have call successors, (185), 128 states have call predecessors, (185), 174 states have return successors, (254), 220 states have call predecessors, (254), 184 states have call successors, (254) [2024-11-20 00:09:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 2907 transitions. [2024-11-20 00:09:33,263 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 2907 transitions. Word has length 145 [2024-11-20 00:09:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:33,263 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 2907 transitions. [2024-11-20 00:09:33,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-20 00:09:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2907 transitions. [2024-11-20 00:09:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:33,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:33,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:33,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 00:09:33,269 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1936824260, now seen corresponding path program 1 times [2024-11-20 00:09:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830835683] [2024-11-20 00:09:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:33,488 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-20 00:09:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830835683] [2024-11-20 00:09:33,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830835683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:33,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:33,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418852709] [2024-11-20 00:09:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:33,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:33,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:33,491 INFO L87 Difference]: Start difference. First operand 2248 states and 2907 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:36,254 INFO L93 Difference]: Finished difference Result 3498 states and 4899 transitions. [2024-11-20 00:09:36,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:09:36,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:36,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:36,264 INFO L225 Difference]: With dead ends: 3498 [2024-11-20 00:09:36,264 INFO L226 Difference]: Without dead ends: 2895 [2024-11-20 00:09:36,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:09:36,267 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1545 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 2734 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1571 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:36,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1571 Valid, 1656 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2734 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 00:09:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2024-11-20 00:09:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2535. [2024-11-20 00:09:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2149 states have (on average 1.3350395532805956) internal successors, (2869), 2163 states have internal predecessors, (2869), 203 states have call successors, (203), 134 states have call predecessors, (203), 181 states have return successors, (274), 239 states have call predecessors, (274), 202 states have call successors, (274) [2024-11-20 00:09:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 3346 transitions. [2024-11-20 00:09:36,539 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 3346 transitions. Word has length 145 [2024-11-20 00:09:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:36,539 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 3346 transitions. [2024-11-20 00:09:36,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 3346 transitions. [2024-11-20 00:09:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:36,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:36,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:36,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:09:36,545 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:36,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:36,545 INFO L85 PathProgramCache]: Analyzing trace with hash -989786374, now seen corresponding path program 1 times [2024-11-20 00:09:36,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:36,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454955026] [2024-11-20 00:09:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:36,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:36,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:36,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:36,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:36,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:36,759 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-20 00:09:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:36,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454955026] [2024-11-20 00:09:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454955026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:36,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:36,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:36,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937954026] [2024-11-20 00:09:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:36,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:36,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:36,762 INFO L87 Difference]: Start difference. First operand 2535 states and 3346 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:39,595 INFO L93 Difference]: Finished difference Result 4586 states and 6606 transitions. [2024-11-20 00:09:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:09:39,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:39,610 INFO L225 Difference]: With dead ends: 4586 [2024-11-20 00:09:39,610 INFO L226 Difference]: Without dead ends: 3696 [2024-11-20 00:09:39,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:09:39,616 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 1474 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 3011 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:39,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 2310 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3011 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 00:09:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2024-11-20 00:09:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3110. [2024-11-20 00:09:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 2674 states have (on average 1.3732236350037397) internal successors, (3672), 2690 states have internal predecessors, (3672), 239 states have call successors, (239), 146 states have call predecessors, (239), 195 states have return successors, (318), 277 states have call predecessors, (318), 238 states have call successors, (318) [2024-11-20 00:09:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 4229 transitions. [2024-11-20 00:09:39,937 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 4229 transitions. Word has length 145 [2024-11-20 00:09:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:39,937 INFO L471 AbstractCegarLoop]: Abstraction has 3110 states and 4229 transitions. [2024-11-20 00:09:39,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 4229 transitions. [2024-11-20 00:09:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:39,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:39,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:39,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:09:39,943 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:39,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash -127952772, now seen corresponding path program 1 times [2024-11-20 00:09:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398695589] [2024-11-20 00:09:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:40,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:40,145 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-20 00:09:40,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398695589] [2024-11-20 00:09:40,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398695589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:40,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:40,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613663808] [2024-11-20 00:09:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:40,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:40,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:40,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:40,148 INFO L87 Difference]: Start difference. First operand 3110 states and 4229 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:43,048 INFO L93 Difference]: Finished difference Result 6681 states and 9873 transitions. [2024-11-20 00:09:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:09:43,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:43,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:43,068 INFO L225 Difference]: With dead ends: 6681 [2024-11-20 00:09:43,068 INFO L226 Difference]: Without dead ends: 5216 [2024-11-20 00:09:43,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:09:43,075 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 1466 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 3008 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 3099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 3008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:43,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 2310 Invalid, 3099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 3008 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 00:09:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2024-11-20 00:09:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 4261. [2024-11-20 00:09:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3725 states have (on average 1.4169127516778524) internal successors, (5278), 3745 states have internal predecessors, (5278), 311 states have call successors, (311), 170 states have call predecessors, (311), 223 states have return successors, (412), 353 states have call predecessors, (412), 310 states have call successors, (412) [2024-11-20 00:09:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6001 transitions. [2024-11-20 00:09:43,530 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6001 transitions. Word has length 145 [2024-11-20 00:09:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:43,530 INFO L471 AbstractCegarLoop]: Abstraction has 4261 states and 6001 transitions. [2024-11-20 00:09:43,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6001 transitions. [2024-11-20 00:09:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:43,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:43,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:43,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:09:43,536 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:43,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:43,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2116605626, now seen corresponding path program 1 times [2024-11-20 00:09:43,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:43,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377380143] [2024-11-20 00:09:43,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:43,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:43,744 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-20 00:09:43,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:43,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377380143] [2024-11-20 00:09:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377380143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:43,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:43,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737046541] [2024-11-20 00:09:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:43,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:43,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:43,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:43,747 INFO L87 Difference]: Start difference. First operand 4261 states and 6001 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:46,800 INFO L93 Difference]: Finished difference Result 10870 states and 16423 transitions. [2024-11-20 00:09:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:09:46,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:46,830 INFO L225 Difference]: With dead ends: 10870 [2024-11-20 00:09:46,830 INFO L226 Difference]: Without dead ends: 8254 [2024-11-20 00:09:46,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:09:46,842 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 1462 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:46,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 2310 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 00:09:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8254 states. [2024-11-20 00:09:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8254 to 6568. [2024-11-20 00:09:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6568 states, 5832 states have (on average 1.4567901234567902) internal successors, (8496), 5860 states have internal predecessors, (8496), 455 states have call successors, (455), 218 states have call predecessors, (455), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2024-11-20 00:09:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 9569 transitions. [2024-11-20 00:09:47,557 INFO L78 Accepts]: Start accepts. Automaton has 6568 states and 9569 transitions. Word has length 145 [2024-11-20 00:09:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:47,557 INFO L471 AbstractCegarLoop]: Abstraction has 6568 states and 9569 transitions. [2024-11-20 00:09:47,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 6568 states and 9569 transitions. [2024-11-20 00:09:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:47,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:47,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:47,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:09:47,565 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:47,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1690314564, now seen corresponding path program 1 times [2024-11-20 00:09:47,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:47,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645055375] [2024-11-20 00:09:47,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:47,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:47,739 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-20 00:09:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645055375] [2024-11-20 00:09:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645055375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445593701] [2024-11-20 00:09:47,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:47,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:47,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:47,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:47,741 INFO L87 Difference]: Start difference. First operand 6568 states and 9569 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:49,593 INFO L93 Difference]: Finished difference Result 13255 states and 20214 transitions. [2024-11-20 00:09:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:09:49,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:49,626 INFO L225 Difference]: With dead ends: 13255 [2024-11-20 00:09:49,627 INFO L226 Difference]: Without dead ends: 8332 [2024-11-20 00:09:49,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:09:49,644 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1124 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:49,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1298 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:09:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8332 states. [2024-11-20 00:09:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8332 to 6568. [2024-11-20 00:09:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6568 states, 5832 states have (on average 1.453875171467764) internal successors, (8479), 5860 states have internal predecessors, (8479), 455 states have call successors, (455), 218 states have call predecessors, (455), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2024-11-20 00:09:50,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 9552 transitions. [2024-11-20 00:09:50,331 INFO L78 Accepts]: Start accepts. Automaton has 6568 states and 9552 transitions. Word has length 145 [2024-11-20 00:09:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:50,332 INFO L471 AbstractCegarLoop]: Abstraction has 6568 states and 9552 transitions. [2024-11-20 00:09:50,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6568 states and 9552 transitions. [2024-11-20 00:09:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:50,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:50,338 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:50,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:09:50,339 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1512017530, now seen corresponding path program 1 times [2024-11-20 00:09:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:50,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603156917] [2024-11-20 00:09:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:50,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:50,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:50,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:50,519 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-20 00:09:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603156917] [2024-11-20 00:09:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603156917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:50,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:50,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953971676] [2024-11-20 00:09:50,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:50,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:50,521 INFO L87 Difference]: Start difference. First operand 6568 states and 9552 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:52,219 INFO L93 Difference]: Finished difference Result 13237 states and 20128 transitions. [2024-11-20 00:09:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:09:52,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:52,246 INFO L225 Difference]: With dead ends: 13237 [2024-11-20 00:09:52,246 INFO L226 Difference]: Without dead ends: 8314 [2024-11-20 00:09:52,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:09:52,260 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1310 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:52,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 1081 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:09:52,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8314 states. [2024-11-20 00:09:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8314 to 6568. [2024-11-20 00:09:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6568 states, 5832 states have (on average 1.450960219478738) internal successors, (8462), 5860 states have internal predecessors, (8462), 455 states have call successors, (455), 218 states have call predecessors, (455), 279 states have return successors, (618), 505 states have call predecessors, (618), 454 states have call successors, (618) [2024-11-20 00:09:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6568 states to 6568 states and 9535 transitions. [2024-11-20 00:09:52,914 INFO L78 Accepts]: Start accepts. Automaton has 6568 states and 9535 transitions. Word has length 145 [2024-11-20 00:09:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:52,914 INFO L471 AbstractCegarLoop]: Abstraction has 6568 states and 9535 transitions. [2024-11-20 00:09:52,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6568 states and 9535 transitions. [2024-11-20 00:09:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:52,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:52,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:52,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:09:52,921 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:52,922 INFO L85 PathProgramCache]: Analyzing trace with hash 229845244, now seen corresponding path program 1 times [2024-11-20 00:09:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353936540] [2024-11-20 00:09:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:53,117 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-20 00:09:53,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:53,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353936540] [2024-11-20 00:09:53,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353936540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:53,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280975598] [2024-11-20 00:09:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:53,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:53,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:53,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:53,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:53,120 INFO L87 Difference]: Start difference. First operand 6568 states and 9535 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:56,347 INFO L93 Difference]: Finished difference Result 19192 states and 29309 transitions. [2024-11-20 00:09:56,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:09:56,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:56,387 INFO L225 Difference]: With dead ends: 19192 [2024-11-20 00:09:56,387 INFO L226 Difference]: Without dead ends: 14269 [2024-11-20 00:09:56,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:09:56,402 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 1448 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 2918 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 2310 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:56,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 2310 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2918 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 00:09:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14269 states. [2024-11-20 00:09:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14269 to 11244. [2024-11-20 00:09:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11244 states, 10108 states have (on average 1.479224376731302) internal successors, (14952), 10152 states have internal predecessors, (14952), 743 states have call successors, (743), 314 states have call predecessors, (743), 391 states have return successors, (1084), 809 states have call predecessors, (1084), 742 states have call successors, (1084) [2024-11-20 00:09:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11244 states to 11244 states and 16779 transitions. [2024-11-20 00:09:57,427 INFO L78 Accepts]: Start accepts. Automaton has 11244 states and 16779 transitions. Word has length 145 [2024-11-20 00:09:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:57,428 INFO L471 AbstractCegarLoop]: Abstraction has 11244 states and 16779 transitions. [2024-11-20 00:09:57,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 11244 states and 16779 transitions. [2024-11-20 00:09:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:09:57,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:57,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:57,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:09:57,440 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:57,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1492157442, now seen corresponding path program 1 times [2024-11-20 00:09:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354563149] [2024-11-20 00:09:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:09:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:09:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:09:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:09:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:57,645 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-20 00:09:57,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354563149] [2024-11-20 00:09:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354563149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:57,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:57,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982403182] [2024-11-20 00:09:57,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:57,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:57,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:57,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:57,648 INFO L87 Difference]: Start difference. First operand 11244 states and 16779 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:09:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:59,946 INFO L93 Difference]: Finished difference Result 24007 states and 37036 transitions. [2024-11-20 00:09:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:09:59,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:09:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:59,979 INFO L225 Difference]: With dead ends: 24007 [2024-11-20 00:09:59,979 INFO L226 Difference]: Without dead ends: 14408 [2024-11-20 00:09:59,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:09:59,999 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 1167 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:59,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 1297 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:10:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14408 states. [2024-11-20 00:10:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14408 to 11244. [2024-11-20 00:10:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11244 states, 10108 states have (on average 1.4759596359319351) internal successors, (14919), 10152 states have internal predecessors, (14919), 743 states have call successors, (743), 314 states have call predecessors, (743), 391 states have return successors, (1084), 809 states have call predecessors, (1084), 742 states have call successors, (1084) [2024-11-20 00:10:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11244 states to 11244 states and 16746 transitions. [2024-11-20 00:10:00,880 INFO L78 Accepts]: Start accepts. Automaton has 11244 states and 16746 transitions. Word has length 145 [2024-11-20 00:10:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:00,880 INFO L471 AbstractCegarLoop]: Abstraction has 11244 states and 16746 transitions. [2024-11-20 00:10:00,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:10:00,881 INFO L276 IsEmpty]: Start isEmpty. Operand 11244 states and 16746 transitions. [2024-11-20 00:10:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:10:00,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:00,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:00,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 00:10:00,892 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:00,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:00,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1824800580, now seen corresponding path program 1 times [2024-11-20 00:10:00,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:00,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571040835] [2024-11-20 00:10:00,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:00,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:10:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:10:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:10:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:01,076 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-20 00:10:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571040835] [2024-11-20 00:10:01,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571040835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:01,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:01,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786636024] [2024-11-20 00:10:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:01,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:01,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:01,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:01,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:01,078 INFO L87 Difference]: Start difference. First operand 11244 states and 16746 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:10:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:05,694 INFO L93 Difference]: Finished difference Result 40232 states and 61993 transitions. [2024-11-20 00:10:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:10:05,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-20 00:10:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:05,792 INFO L225 Difference]: With dead ends: 40232 [2024-11-20 00:10:05,792 INFO L226 Difference]: Without dead ends: 30633 [2024-11-20 00:10:05,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:10:05,826 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 1533 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 3559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:05,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1558 Valid, 2300 Invalid, 3559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-20 00:10:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30633 states. [2024-11-20 00:10:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30633 to 20558. [2024-11-20 00:10:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20558 states, 18654 states have (on average 1.4941031414173904) internal successors, (27871), 18730 states have internal predecessors, (27871), 1287 states have call successors, (1287), 506 states have call predecessors, (1287), 615 states have return successors, (2146), 1385 states have call predecessors, (2146), 1286 states have call successors, (2146) [2024-11-20 00:10:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20558 states to 20558 states and 31304 transitions. [2024-11-20 00:10:07,546 INFO L78 Accepts]: Start accepts. Automaton has 20558 states and 31304 transitions. Word has length 145 [2024-11-20 00:10:07,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:07,547 INFO L471 AbstractCegarLoop]: Abstraction has 20558 states and 31304 transitions. [2024-11-20 00:10:07,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-20 00:10:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20558 states and 31304 transitions. [2024-11-20 00:10:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:10:07,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:07,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:07,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 00:10:07,561 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:07,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:07,562 INFO L85 PathProgramCache]: Analyzing trace with hash 104131646, now seen corresponding path program 1 times [2024-11-20 00:10:07,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:07,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385673269] [2024-11-20 00:10:07,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:07,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-20 00:10:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 00:10:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:10:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 00:10:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:07,739 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-20 00:10:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385673269] [2024-11-20 00:10:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385673269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:07,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:07,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:07,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862777167] [2024-11-20 00:10:07,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:07,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:07,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:07,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:07,742 INFO L87 Difference]: Start difference. First operand 20558 states and 31304 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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)