./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.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.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 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:43:31,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:43:31,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:43:31,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:43:31,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:43:31,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:43:31,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:43:31,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:43:31,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:43:31,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:43:31,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:43:31,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:43:31,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:43:31,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:43:31,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:43:31,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:43:31,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:43:31,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:43:31,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:43:31,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:43:31,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:43:31,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:43:31,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:43:31,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:43:31,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:43:31,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:43:31,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:43:31,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:43:31,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:43:31,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:43:31,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:43:31,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:43:31,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:43:31,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:43:31,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:43:31,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:43:31,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:43:31,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:43:31,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:43:31,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:43:31,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:43:31,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:43:31,697 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 -> 2299ca1c26d35c3e5f6d860495fd40e041317a8644bf02bee237b59c63427ec2 [2024-10-12 21:43:31,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:43:31,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:43:31,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:43:31,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:43:31,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:43:31,945 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.06.cil-1.c [2024-10-12 21:43:33,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:43:33,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:43:33,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2024-10-12 21:43:33,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b192d259f/178b62b17e144ed79438d124aa931e40/FLAGfed0409e0 [2024-10-12 21:43:33,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b192d259f/178b62b17e144ed79438d124aa931e40 [2024-10-12 21:43:33,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:43:33,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:43:33,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:43:33,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:43:33,743 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:43:33,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:43:33" (1/1) ... [2024-10-12 21:43:33,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ff6653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:33, skipping insertion in model container [2024-10-12 21:43:33,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:43:33" (1/1) ... [2024-10-12 21:43:33,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:43:33,921 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[914,927] [2024-10-12 21:43:33,981 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2024-10-12 21:43:34,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:43:34,065 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:43:34,078 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[914,927] [2024-10-12 21:43:34,097 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c[7115,7128] [2024-10-12 21:43:34,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:43:34,150 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:43:34,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34 WrapperNode [2024-10-12 21:43:34,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:43:34,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:43:34,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:43:34,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:43:34,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,202 INFO L138 Inliner]: procedures = 65, calls = 76, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 714 [2024-10-12 21:43:34,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:43:34,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:43:34,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:43:34,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:43:34,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,246 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 21:43:34,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:43:34,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:43:34,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:43:34,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:43:34,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (1/1) ... [2024-10-12 21:43:34,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:43:34,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:43:34,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 21:43:34,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 21:43:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:43:34,353 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:43:34,353 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:43:34,353 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 21:43:34,354 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 21:43:34,354 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:43:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:43:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:43:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:43:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-12 21:43:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-12 21:43:34,355 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:43:34,355 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:43:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:43:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:43:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-12 21:43:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-12 21:43:34,356 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 21:43:34,356 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 21:43:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-12 21:43:34,357 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-12 21:43:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:43:34,357 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:43:34,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:43:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:43:34,358 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:43:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-12 21:43:34,358 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-12 21:43:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:43:34,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:43:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:43:34,358 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:43:34,358 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:43:34,359 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:43:34,467 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:43:34,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:43:35,043 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2024-10-12 21:43:35,043 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:43:35,090 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:43:35,090 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-12 21:43:35,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:43:35 BoogieIcfgContainer [2024-10-12 21:43:35,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:43:35,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:43:35,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:43:35,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:43:35,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:43:33" (1/3) ... [2024-10-12 21:43:35,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f3fc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:43:35, skipping insertion in model container [2024-10-12 21:43:35,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:43:34" (2/3) ... [2024-10-12 21:43:35,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f3fc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:43:35, skipping insertion in model container [2024-10-12 21:43:35,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:43:35" (3/3) ... [2024-10-12 21:43:35,098 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2024-10-12 21:43:35,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:43:35,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:43:35,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:43:35,174 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;@3b0ceb29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:43:35,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:43:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 255 states have (on average 1.6901960784313725) internal successors, (431), 263 states have internal predecessors, (431), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-12 21:43:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:35,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:35,186 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] [2024-10-12 21:43:35,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:35,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1352984849, now seen corresponding path program 1 times [2024-10-12 21:43:35,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:35,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255186101] [2024-10-12 21:43:35,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:35,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:35,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:35,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255186101] [2024-10-12 21:43:35,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255186101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:35,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:43:35,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582062441] [2024-10-12 21:43:35,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:35,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:43:35,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:35,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:43:35,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:43:35,698 INFO L87 Difference]: Start difference. First operand has 309 states, 255 states have (on average 1.6901960784313725) internal successors, (431), 263 states have internal predecessors, (431), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-10-12 21:43:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:36,675 INFO L93 Difference]: Finished difference Result 723 states and 1169 transitions. [2024-10-12 21:43:36,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:43:36,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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 58 [2024-10-12 21:43:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:36,691 INFO L225 Difference]: With dead ends: 723 [2024-10-12 21:43:36,691 INFO L226 Difference]: Without dead ends: 428 [2024-10-12 21:43:36,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:43:36,699 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 806 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:36,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1230 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:43:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-12 21:43:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 391. [2024-10-12 21:43:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 320 states have (on average 1.546875) internal successors, (495), 327 states have internal predecessors, (495), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2024-10-12 21:43:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 590 transitions. [2024-10-12 21:43:36,767 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 590 transitions. Word has length 58 [2024-10-12 21:43:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:36,767 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 590 transitions. [2024-10-12 21:43:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 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-10-12 21:43:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 590 transitions. [2024-10-12 21:43:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:36,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:36,770 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] [2024-10-12 21:43:36,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:43:36,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:36,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1218751185, now seen corresponding path program 1 times [2024-10-12 21:43:36,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:36,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703208869] [2024-10-12 21:43:36,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:36,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:36,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703208869] [2024-10-12 21:43:36,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703208869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:36,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:36,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:43:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584886375] [2024-10-12 21:43:36,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:36,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:43:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:43:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:43:36,939 INFO L87 Difference]: Start difference. First operand 391 states and 590 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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-10-12 21:43:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:37,814 INFO L93 Difference]: Finished difference Result 711 states and 1040 transitions. [2024-10-12 21:43:37,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 21:43:37,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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 58 [2024-10-12 21:43:37,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:37,818 INFO L225 Difference]: With dead ends: 711 [2024-10-12 21:43:37,818 INFO L226 Difference]: Without dead ends: 549 [2024-10-12 21:43:37,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 21:43:37,820 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 1128 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:37,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1234 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-12 21:43:37,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 479. [2024-10-12 21:43:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 388 states have (on average 1.5231958762886597) internal successors, (591), 397 states have internal predecessors, (591), 58 states have call successors, (58), 29 states have call predecessors, (58), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2024-10-12 21:43:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 716 transitions. [2024-10-12 21:43:37,872 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 716 transitions. Word has length 58 [2024-10-12 21:43:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:37,873 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 716 transitions. [2024-10-12 21:43:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 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-10-12 21:43:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 716 transitions. [2024-10-12 21:43:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 21:43:37,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:37,875 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] [2024-10-12 21:43:37,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:43:37,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:37,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1147943409, now seen corresponding path program 1 times [2024-10-12 21:43:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:37,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789860240] [2024-10-12 21:43:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:38,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:38,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:38,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789860240] [2024-10-12 21:43:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789860240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:38,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:38,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 21:43:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838751775] [2024-10-12 21:43:38,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:38,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:43:38,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:38,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:43:38,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:43:38,015 INFO L87 Difference]: Start difference. First operand 479 states and 716 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:43:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:39,548 INFO L93 Difference]: Finished difference Result 1717 states and 2468 transitions. [2024-10-12 21:43:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 21:43:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-12 21:43:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:39,555 INFO L225 Difference]: With dead ends: 1717 [2024-10-12 21:43:39,555 INFO L226 Difference]: Without dead ends: 1455 [2024-10-12 21:43:39,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 21:43:39,557 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 2449 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:39,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2463 Valid, 1689 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:43:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-10-12 21:43:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1302. [2024-10-12 21:43:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 1028 states have (on average 1.4231517509727627) internal successors, (1463), 1052 states have internal predecessors, (1463), 146 states have call successors, (146), 112 states have call predecessors, (146), 126 states have return successors, (178), 140 states have call predecessors, (178), 142 states have call successors, (178) [2024-10-12 21:43:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1787 transitions. [2024-10-12 21:43:39,647 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1787 transitions. Word has length 58 [2024-10-12 21:43:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:39,647 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1787 transitions. [2024-10-12 21:43:39,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 21:43:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1787 transitions. [2024-10-12 21:43:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:43:39,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:39,649 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] [2024-10-12 21:43:39,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:43:39,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:39,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:39,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1595237125, now seen corresponding path program 1 times [2024-10-12 21:43:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:39,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139507275] [2024-10-12 21:43:39,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:39,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139507275] [2024-10-12 21:43:39,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139507275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:39,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:39,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:43:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772929468] [2024-10-12 21:43:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:39,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:43:39,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:43:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:43:39,781 INFO L87 Difference]: Start difference. First operand 1302 states and 1787 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-10-12 21:43:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:40,614 INFO L93 Difference]: Finished difference Result 2525 states and 3431 transitions. [2024-10-12 21:43:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:43:40,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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 59 [2024-10-12 21:43:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:40,624 INFO L225 Difference]: With dead ends: 2525 [2024-10-12 21:43:40,624 INFO L226 Difference]: Without dead ends: 1446 [2024-10-12 21:43:40,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:43:40,628 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 385 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:40,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1687 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-10-12 21:43:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1326. [2024-10-12 21:43:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1046 states have (on average 1.4082217973231357) internal successors, (1473), 1070 states have internal predecessors, (1473), 146 states have call successors, (146), 112 states have call predecessors, (146), 132 states have return successors, (184), 146 states have call predecessors, (184), 142 states have call successors, (184) [2024-10-12 21:43:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1803 transitions. [2024-10-12 21:43:40,699 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1803 transitions. Word has length 59 [2024-10-12 21:43:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:40,699 INFO L471 AbstractCegarLoop]: Abstraction has 1326 states and 1803 transitions. [2024-10-12 21:43:40,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 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-10-12 21:43:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1803 transitions. [2024-10-12 21:43:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:43:40,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:40,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:43:40,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:43:40,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:40,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:40,701 INFO L85 PathProgramCache]: Analyzing trace with hash 327990909, now seen corresponding path program 1 times [2024-10-12 21:43:40,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:40,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223099793] [2024-10-12 21:43:40,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:40,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:40,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:40,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223099793] [2024-10-12 21:43:40,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223099793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:40,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:40,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:43:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047602593] [2024-10-12 21:43:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:40,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:43:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:43:40,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:43:40,839 INFO L87 Difference]: Start difference. First operand 1326 states and 1803 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-10-12 21:43:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:41,726 INFO L93 Difference]: Finished difference Result 2574 states and 3404 transitions. [2024-10-12 21:43:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 21:43:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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 59 [2024-10-12 21:43:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:41,734 INFO L225 Difference]: With dead ends: 2574 [2024-10-12 21:43:41,734 INFO L226 Difference]: Without dead ends: 1678 [2024-10-12 21:43:41,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2024-10-12 21:43:41,736 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 1132 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:41,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1034 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-10-12 21:43:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1271. [2024-10-12 21:43:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1007 states have (on average 1.4061569016881827) internal successors, (1416), 1026 states have internal predecessors, (1416), 140 states have call successors, (140), 107 states have call predecessors, (140), 122 states have return successors, (169), 139 states have call predecessors, (169), 136 states have call successors, (169) [2024-10-12 21:43:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1725 transitions. [2024-10-12 21:43:41,847 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1725 transitions. Word has length 59 [2024-10-12 21:43:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:41,847 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1725 transitions. [2024-10-12 21:43:41,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 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-10-12 21:43:41,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1725 transitions. [2024-10-12 21:43:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:43:41,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:41,848 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] [2024-10-12 21:43:41,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:43:41,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:41,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:41,850 INFO L85 PathProgramCache]: Analyzing trace with hash 546845627, now seen corresponding path program 1 times [2024-10-12 21:43:41,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:41,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732674655] [2024-10-12 21:43:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:41,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:41,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:41,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:41,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732674655] [2024-10-12 21:43:41,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732674655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:41,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:41,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:41,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102732560] [2024-10-12 21:43:41,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:41,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:41,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:41,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:41,944 INFO L87 Difference]: Start difference. First operand 1271 states and 1725 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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-10-12 21:43:42,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:42,560 INFO L93 Difference]: Finished difference Result 3443 states and 4561 transitions. [2024-10-12 21:43:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 21:43:42,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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 59 [2024-10-12 21:43:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:42,571 INFO L225 Difference]: With dead ends: 3443 [2024-10-12 21:43:42,571 INFO L226 Difference]: Without dead ends: 2396 [2024-10-12 21:43:42,573 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-10-12 21:43:42,574 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1107 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:42,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 837 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:43:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2024-10-12 21:43:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 2280. [2024-10-12 21:43:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 1757 states have (on average 1.3392145702902676) internal successors, (2353), 1800 states have internal predecessors, (2353), 270 states have call successors, (270), 206 states have call predecessors, (270), 251 states have return successors, (381), 276 states have call predecessors, (381), 266 states have call successors, (381) [2024-10-12 21:43:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3004 transitions. [2024-10-12 21:43:42,722 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3004 transitions. Word has length 59 [2024-10-12 21:43:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:42,725 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3004 transitions. [2024-10-12 21:43:42,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 4 states have internal predecessors, (44), 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-10-12 21:43:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3004 transitions. [2024-10-12 21:43:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:43:42,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:42,727 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] [2024-10-12 21:43:42,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:43:42,727 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:42,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash 455283125, now seen corresponding path program 1 times [2024-10-12 21:43:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:42,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036703841] [2024-10-12 21:43:42,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:42,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:42,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036703841] [2024-10-12 21:43:42,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036703841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:42,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:42,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:43:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415769574] [2024-10-12 21:43:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:42,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:43:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:43:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:43:42,797 INFO L87 Difference]: Start difference. First operand 2280 states and 3004 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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-10-12 21:43:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:43,490 INFO L93 Difference]: Finished difference Result 5422 states and 7060 transitions. [2024-10-12 21:43:43,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:43:43,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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 60 [2024-10-12 21:43:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:43,504 INFO L225 Difference]: With dead ends: 5422 [2024-10-12 21:43:43,504 INFO L226 Difference]: Without dead ends: 3371 [2024-10-12 21:43:43,509 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-10-12 21:43:43,509 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 553 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:43,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1004 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:43:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2024-10-12 21:43:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 3050. [2024-10-12 21:43:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3050 states, 2338 states have (on average 1.322070145423439) internal successors, (3091), 2388 states have internal predecessors, (3091), 366 states have call successors, (366), 286 states have call predecessors, (366), 344 states have return successors, (500), 378 states have call predecessors, (500), 362 states have call successors, (500) [2024-10-12 21:43:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 3957 transitions. [2024-10-12 21:43:43,740 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 3957 transitions. Word has length 60 [2024-10-12 21:43:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:43,741 INFO L471 AbstractCegarLoop]: Abstraction has 3050 states and 3957 transitions. [2024-10-12 21:43:43,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 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-10-12 21:43:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 3957 transitions. [2024-10-12 21:43:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 21:43:43,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:43,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, 1] [2024-10-12 21:43:43,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 21:43:43,742 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:43,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:43,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1180510132, now seen corresponding path program 1 times [2024-10-12 21:43:43,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:43,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544314923] [2024-10-12 21:43:43,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:43,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:43,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:43,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544314923] [2024-10-12 21:43:43,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544314923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:43,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:43,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:43:43,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199658974] [2024-10-12 21:43:43,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:43,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:43:43,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:43,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:43:43,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:43:43,795 INFO L87 Difference]: Start difference. First operand 3050 states and 3957 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-10-12 21:43:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:44,450 INFO L93 Difference]: Finished difference Result 6740 states and 8660 transitions. [2024-10-12 21:43:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:43:44,451 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-10-12 21:43:44,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:44,465 INFO L225 Difference]: With dead ends: 6740 [2024-10-12 21:43:44,466 INFO L226 Difference]: Without dead ends: 3917 [2024-10-12 21:43:44,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:43:44,471 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 1070 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:44,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 689 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:43:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3917 states. [2024-10-12 21:43:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3917 to 3575. [2024-10-12 21:43:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3575 states, 2743 states have (on average 1.3142544659132336) internal successors, (3605), 2797 states have internal predecessors, (3605), 425 states have call successors, (425), 336 states have call predecessors, (425), 405 states have return successors, (582), 444 states have call predecessors, (582), 421 states have call successors, (582) [2024-10-12 21:43:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 4612 transitions. [2024-10-12 21:43:44,709 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 4612 transitions. Word has length 66 [2024-10-12 21:43:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:44,710 INFO L471 AbstractCegarLoop]: Abstraction has 3575 states and 4612 transitions. [2024-10-12 21:43:44,710 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-10-12 21:43:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 4612 transitions. [2024-10-12 21:43:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 21:43:44,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:44,711 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] [2024-10-12 21:43:44,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 21:43:44,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:44,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:44,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1719551705, now seen corresponding path program 1 times [2024-10-12 21:43:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:44,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549631255] [2024-10-12 21:43:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:44,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:44,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:44,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:44,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:44,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549631255] [2024-10-12 21:43:44,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549631255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:44,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:44,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724477810] [2024-10-12 21:43:44,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:44,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:44,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:44,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:44,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:44,777 INFO L87 Difference]: Start difference. First operand 3575 states and 4612 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-10-12 21:43:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:45,626 INFO L93 Difference]: Finished difference Result 4683 states and 5994 transitions. [2024-10-12 21:43:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 21:43:45,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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 67 [2024-10-12 21:43:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:45,642 INFO L225 Difference]: With dead ends: 4683 [2024-10-12 21:43:45,643 INFO L226 Difference]: Without dead ends: 4680 [2024-10-12 21:43:45,644 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-10-12 21:43:45,644 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1290 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1299 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:45,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1299 Valid, 856 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:43:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2024-10-12 21:43:45,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4002. [2024-10-12 21:43:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4002 states, 3060 states have (on average 1.304248366013072) internal successors, (3991), 3118 states have internal predecessors, (3991), 478 states have call successors, (478), 380 states have call predecessors, (478), 462 states have return successors, (664), 506 states have call predecessors, (664), 475 states have call successors, (664) [2024-10-12 21:43:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4002 states to 4002 states and 5133 transitions. [2024-10-12 21:43:45,898 INFO L78 Accepts]: Start accepts. Automaton has 4002 states and 5133 transitions. Word has length 67 [2024-10-12 21:43:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:45,899 INFO L471 AbstractCegarLoop]: Abstraction has 4002 states and 5133 transitions. [2024-10-12 21:43:45,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 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-10-12 21:43:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4002 states and 5133 transitions. [2024-10-12 21:43:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-12 21:43:45,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:45,901 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] [2024-10-12 21:43:45,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 21:43:45,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:45,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1765467294, now seen corresponding path program 1 times [2024-10-12 21:43:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:45,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195001437] [2024-10-12 21:43:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:46,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195001437] [2024-10-12 21:43:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195001437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:43:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023108912] [2024-10-12 21:43:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:46,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:43:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:43:46,025 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-10-12 21:43:46,026 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-10-12 21:43:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:46,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:43:46,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:43:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:46,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:43:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:46,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023108912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:43:46,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:43:46,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-10-12 21:43:46,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236715935] [2024-10-12 21:43:46,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:43:46,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 21:43:46,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:46,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 21:43:46,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:43:46,427 INFO L87 Difference]: Start difference. First operand 4002 states and 5133 transitions. Second operand has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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-10-12 21:43:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:48,147 INFO L93 Difference]: Finished difference Result 8209 states and 10407 transitions. [2024-10-12 21:43:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 21:43:48,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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 68 [2024-10-12 21:43:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:48,175 INFO L225 Difference]: With dead ends: 8209 [2024-10-12 21:43:48,175 INFO L226 Difference]: Without dead ends: 8206 [2024-10-12 21:43:48,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2024-10-12 21:43:48,178 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1224 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:48,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 1806 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:43:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8206 states. [2024-10-12 21:43:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8206 to 7181. [2024-10-12 21:43:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7181 states, 5472 states have (on average 1.2905701754385965) internal successors, (7062), 5574 states have internal predecessors, (7062), 857 states have call successors, (857), 694 states have call predecessors, (857), 850 states have return successors, (1201), 915 states have call predecessors, (1201), 854 states have call successors, (1201) [2024-10-12 21:43:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7181 states to 7181 states and 9120 transitions. [2024-10-12 21:43:48,707 INFO L78 Accepts]: Start accepts. Automaton has 7181 states and 9120 transitions. Word has length 68 [2024-10-12 21:43:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:48,707 INFO L471 AbstractCegarLoop]: Abstraction has 7181 states and 9120 transitions. [2024-10-12 21:43:48,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.9) internal successors, (109), 7 states have internal predecessors, (109), 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-10-12 21:43:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7181 states and 9120 transitions. [2024-10-12 21:43:48,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-12 21:43:48,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:48,710 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] [2024-10-12 21:43:48,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 21:43:48,914 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,SelfDestructingSolverStorable9 [2024-10-12 21:43:48,915 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:48,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1942506137, now seen corresponding path program 2 times [2024-10-12 21:43:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:48,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860764087] [2024-10-12 21:43:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860764087] [2024-10-12 21:43:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860764087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:43:48,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34726567] [2024-10-12 21:43:48,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:48,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:43:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:43:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:43:48,966 INFO L87 Difference]: Start difference. First operand 7181 states and 9120 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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-10-12 21:43:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:49,677 INFO L93 Difference]: Finished difference Result 9691 states and 12332 transitions. [2024-10-12 21:43:49,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 21:43:49,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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 71 [2024-10-12 21:43:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:49,698 INFO L225 Difference]: With dead ends: 9691 [2024-10-12 21:43:49,698 INFO L226 Difference]: Without dead ends: 3986 [2024-10-12 21:43:49,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-12 21:43:49,708 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 795 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:49,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 923 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:43:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-10-12 21:43:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 2941. [2024-10-12 21:43:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2264 states have (on average 1.2901943462897527) internal successors, (2921), 2300 states have internal predecessors, (2921), 350 states have call successors, (350), 276 states have call predecessors, (350), 325 states have return successors, (460), 367 states have call predecessors, (460), 347 states have call successors, (460) [2024-10-12 21:43:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 3731 transitions. [2024-10-12 21:43:50,022 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 3731 transitions. Word has length 71 [2024-10-12 21:43:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:50,023 INFO L471 AbstractCegarLoop]: Abstraction has 2941 states and 3731 transitions. [2024-10-12 21:43:50,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 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-10-12 21:43:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 3731 transitions. [2024-10-12 21:43:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 21:43:50,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:50,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 21:43:50,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 21:43:50,025 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:50,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash 854652747, now seen corresponding path program 1 times [2024-10-12 21:43:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220664525] [2024-10-12 21:43:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 21:43:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:43:50,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:50,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220664525] [2024-10-12 21:43:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220664525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 21:43:50,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045532520] [2024-10-12 21:43:50,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:50,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:43:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:43:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:43:50,136 INFO L87 Difference]: Start difference. First operand 2941 states and 3731 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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-10-12 21:43:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:51,304 INFO L93 Difference]: Finished difference Result 8543 states and 10741 transitions. [2024-10-12 21:43:51,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 21:43:51,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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 76 [2024-10-12 21:43:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:51,325 INFO L225 Difference]: With dead ends: 8543 [2024-10-12 21:43:51,325 INFO L226 Difference]: Without dead ends: 5030 [2024-10-12 21:43:51,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2024-10-12 21:43:51,331 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 839 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:51,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1513 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:43:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2024-10-12 21:43:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 4683. [2024-10-12 21:43:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4683 states, 3551 states have (on average 1.2562658406082794) internal successors, (4461), 3618 states have internal predecessors, (4461), 568 states have call successors, (568), 448 states have call predecessors, (568), 562 states have return successors, (854), 619 states have call predecessors, (854), 565 states have call successors, (854) [2024-10-12 21:43:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 5883 transitions. [2024-10-12 21:43:51,675 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 5883 transitions. Word has length 76 [2024-10-12 21:43:51,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:51,675 INFO L471 AbstractCegarLoop]: Abstraction has 4683 states and 5883 transitions. [2024-10-12 21:43:51,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 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-10-12 21:43:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 5883 transitions. [2024-10-12 21:43:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 21:43:51,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:51,677 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-12 21:43:51,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:43:51,677 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:51,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash -91040578, now seen corresponding path program 1 times [2024-10-12 21:43:51,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:51,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803064647] [2024-10-12 21:43:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:51,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 21:43:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 21:43:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 21:43:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 21:43:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 21:43:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:43:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 21:43:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 21:43:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803064647] [2024-10-12 21:43:51,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803064647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:51,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:51,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 21:43:51,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365720752] [2024-10-12 21:43:51,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:51,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 21:43:51,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:51,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 21:43:51,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:43:51,758 INFO L87 Difference]: Start difference. First operand 4683 states and 5883 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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-10-12 21:43:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:52,952 INFO L93 Difference]: Finished difference Result 8711 states and 10818 transitions. [2024-10-12 21:43:52,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 21:43:52,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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 86 [2024-10-12 21:43:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:52,972 INFO L225 Difference]: With dead ends: 8711 [2024-10-12 21:43:52,972 INFO L226 Difference]: Without dead ends: 4778 [2024-10-12 21:43:52,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-12 21:43:52,980 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1988 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2021 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:52,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2021 Valid, 1106 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:43:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4778 states. [2024-10-12 21:43:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4778 to 4412. [2024-10-12 21:43:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4412 states, 3328 states have (on average 1.2328725961538463) internal successors, (4103), 3397 states have internal predecessors, (4103), 538 states have call successors, (538), 430 states have call predecessors, (538), 544 states have return successors, (745), 587 states have call predecessors, (745), 535 states have call successors, (745) [2024-10-12 21:43:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 4412 states and 5386 transitions. [2024-10-12 21:43:53,305 INFO L78 Accepts]: Start accepts. Automaton has 4412 states and 5386 transitions. Word has length 86 [2024-10-12 21:43:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:53,305 INFO L471 AbstractCegarLoop]: Abstraction has 4412 states and 5386 transitions. [2024-10-12 21:43:53,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 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-10-12 21:43:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4412 states and 5386 transitions. [2024-10-12 21:43:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:43:53,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:53,307 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] [2024-10-12 21:43:53,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 21:43:53,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:53,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:53,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1641909896, now seen corresponding path program 1 times [2024-10-12 21:43:53,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:53,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478758249] [2024-10-12 21:43:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:53,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:53,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:43:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:53,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:43:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:43:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:43:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478758249] [2024-10-12 21:43:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478758249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:53,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:43:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85722401] [2024-10-12 21:43:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:53,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:43:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:43:53,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:43:53,418 INFO L87 Difference]: Start difference. First operand 4412 states and 5386 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:54,925 INFO L93 Difference]: Finished difference Result 4687 states and 5835 transitions. [2024-10-12 21:43:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:43:54,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:43:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:54,937 INFO L225 Difference]: With dead ends: 4687 [2024-10-12 21:43:54,938 INFO L226 Difference]: Without dead ends: 4482 [2024-10-12 21:43:54,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:43:54,939 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 657 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:54,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 613 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:43:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2024-10-12 21:43:55,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4412. [2024-10-12 21:43:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4412 states, 3328 states have (on average 1.2325721153846154) internal successors, (4102), 3397 states have internal predecessors, (4102), 538 states have call successors, (538), 430 states have call predecessors, (538), 544 states have return successors, (745), 587 states have call predecessors, (745), 535 states have call successors, (745) [2024-10-12 21:43:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4412 states to 4412 states and 5385 transitions. [2024-10-12 21:43:55,458 INFO L78 Accepts]: Start accepts. Automaton has 4412 states and 5385 transitions. Word has length 102 [2024-10-12 21:43:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:55,458 INFO L471 AbstractCegarLoop]: Abstraction has 4412 states and 5385 transitions. [2024-10-12 21:43:55,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:55,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4412 states and 5385 transitions. [2024-10-12 21:43:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:43:55,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:55,460 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] [2024-10-12 21:43:55,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:43:55,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:55,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:55,461 INFO L85 PathProgramCache]: Analyzing trace with hash -235153334, now seen corresponding path program 1 times [2024-10-12 21:43:55,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584497491] [2024-10-12 21:43:55,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:55,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:55,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:43:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:43:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:43:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:55,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:43:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:55,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584497491] [2024-10-12 21:43:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584497491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:55,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:55,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983243384] [2024-10-12 21:43:55,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:55,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:55,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:55,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:55,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:55,574 INFO L87 Difference]: Start difference. First operand 4412 states and 5385 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:57,550 INFO L93 Difference]: Finished difference Result 4978 states and 6320 transitions. [2024-10-12 21:43:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:43:57,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:43:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:57,561 INFO L225 Difference]: With dead ends: 4978 [2024-10-12 21:43:57,562 INFO L226 Difference]: Without dead ends: 4775 [2024-10-12 21:43:57,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:43:57,563 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 1000 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 2432 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:57,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1525 Invalid, 2524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2432 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:43:57,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4775 states. [2024-10-12 21:43:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4775 to 4624. [2024-10-12 21:43:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4624 states, 3515 states have (on average 1.253769559032717) internal successors, (4407), 3586 states have internal predecessors, (4407), 555 states have call successors, (555), 436 states have call predecessors, (555), 552 states have return successors, (769), 605 states have call predecessors, (769), 552 states have call successors, (769) [2024-10-12 21:43:58,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 5731 transitions. [2024-10-12 21:43:58,142 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 5731 transitions. Word has length 102 [2024-10-12 21:43:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:58,143 INFO L471 AbstractCegarLoop]: Abstraction has 4624 states and 5731 transitions. [2024-10-12 21:43:58,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 5731 transitions. [2024-10-12 21:43:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:43:58,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:58,146 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] [2024-10-12 21:43:58,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:43:58,147 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:58,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2101239176, now seen corresponding path program 1 times [2024-10-12 21:43:58,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:58,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744088815] [2024-10-12 21:43:58,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:58,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:43:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:58,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:43:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:58,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:43:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:43:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:43:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:58,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744088815] [2024-10-12 21:43:58,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744088815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:58,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:58,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:58,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742861496] [2024-10-12 21:43:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:58,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:58,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:58,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:58,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:58,287 INFO L87 Difference]: Start difference. First operand 4624 states and 5731 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:00,307 INFO L93 Difference]: Finished difference Result 5692 states and 7482 transitions. [2024-10-12 21:44:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:44:00,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:00,320 INFO L225 Difference]: With dead ends: 5692 [2024-10-12 21:44:00,321 INFO L226 Difference]: Without dead ends: 5279 [2024-10-12 21:44:00,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:44:00,323 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1025 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:00,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1435 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:44:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2024-10-12 21:44:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 5012. [2024-10-12 21:44:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 3859 states have (on average 1.2847888053899974) internal successors, (4958), 3932 states have internal predecessors, (4958), 585 states have call successors, (585), 448 states have call predecessors, (585), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2024-10-12 21:44:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6352 transitions. [2024-10-12 21:44:00,894 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6352 transitions. Word has length 102 [2024-10-12 21:44:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:00,894 INFO L471 AbstractCegarLoop]: Abstraction has 5012 states and 6352 transitions. [2024-10-12 21:44:00,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6352 transitions. [2024-10-12 21:44:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:00,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:00,897 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] [2024-10-12 21:44:00,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:44:00,897 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:00,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash -317245302, now seen corresponding path program 1 times [2024-10-12 21:44:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:00,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997199509] [2024-10-12 21:44:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:00,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:00,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:00,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:01,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:01,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997199509] [2024-10-12 21:44:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997199509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746194975] [2024-10-12 21:44:01,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:01,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:01,006 INFO L87 Difference]: Start difference. First operand 5012 states and 6352 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:02,342 INFO L93 Difference]: Finished difference Result 6085 states and 8126 transitions. [2024-10-12 21:44:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:02,357 INFO L225 Difference]: With dead ends: 6085 [2024-10-12 21:44:02,358 INFO L226 Difference]: Without dead ends: 5282 [2024-10-12 21:44:02,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:44:02,361 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 949 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:02,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 730 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 21:44:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5282 states. [2024-10-12 21:44:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5282 to 5012. [2024-10-12 21:44:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 3859 states have (on average 1.2834931329359938) internal successors, (4953), 3932 states have internal predecessors, (4953), 585 states have call successors, (585), 448 states have call predecessors, (585), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2024-10-12 21:44:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6347 transitions. [2024-10-12 21:44:02,999 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6347 transitions. Word has length 102 [2024-10-12 21:44:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:03,000 INFO L471 AbstractCegarLoop]: Abstraction has 5012 states and 6347 transitions. [2024-10-12 21:44:03,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6347 transitions. [2024-10-12 21:44:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:03,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:03,002 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] [2024-10-12 21:44:03,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:44:03,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:03,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2098591048, now seen corresponding path program 1 times [2024-10-12 21:44:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548268499] [2024-10-12 21:44:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:03,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:03,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548268499] [2024-10-12 21:44:03,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548268499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:03,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:03,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:03,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636178333] [2024-10-12 21:44:03,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:03,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:03,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:03,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:03,108 INFO L87 Difference]: Start difference. First operand 5012 states and 6347 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:04,766 INFO L93 Difference]: Finished difference Result 6081 states and 8105 transitions. [2024-10-12 21:44:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:04,780 INFO L225 Difference]: With dead ends: 6081 [2024-10-12 21:44:04,780 INFO L226 Difference]: Without dead ends: 5278 [2024-10-12 21:44:04,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:44:04,784 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 814 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:04,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 880 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:44:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2024-10-12 21:44:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 5012. [2024-10-12 21:44:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 3859 states have (on average 1.2821974604819901) internal successors, (4948), 3932 states have internal predecessors, (4948), 585 states have call successors, (585), 448 states have call predecessors, (585), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2024-10-12 21:44:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6342 transitions. [2024-10-12 21:44:05,413 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6342 transitions. Word has length 102 [2024-10-12 21:44:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:05,413 INFO L471 AbstractCegarLoop]: Abstraction has 5012 states and 6342 transitions. [2024-10-12 21:44:05,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6342 transitions. [2024-10-12 21:44:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:05,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:05,416 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] [2024-10-12 21:44:05,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:44:05,416 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:05,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -871520054, now seen corresponding path program 1 times [2024-10-12 21:44:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:05,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851905758] [2024-10-12 21:44:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:05,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:05,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:05,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851905758] [2024-10-12 21:44:05,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851905758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:05,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:05,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:05,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108238121] [2024-10-12 21:44:05,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:05,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:05,508 INFO L87 Difference]: Start difference. First operand 5012 states and 6342 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:06,808 INFO L93 Difference]: Finished difference Result 6076 states and 8082 transitions. [2024-10-12 21:44:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:06,820 INFO L225 Difference]: With dead ends: 6076 [2024-10-12 21:44:06,820 INFO L226 Difference]: Without dead ends: 5273 [2024-10-12 21:44:06,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:44:06,823 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 945 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:06,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 730 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:44:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2024-10-12 21:44:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5012. [2024-10-12 21:44:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5012 states, 3859 states have (on average 1.2809017880279865) internal successors, (4943), 3932 states have internal predecessors, (4943), 585 states have call successors, (585), 448 states have call predecessors, (585), 566 states have return successors, (809), 637 states have call predecessors, (809), 582 states have call successors, (809) [2024-10-12 21:44:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5012 states to 5012 states and 6337 transitions. [2024-10-12 21:44:07,438 INFO L78 Accepts]: Start accepts. Automaton has 5012 states and 6337 transitions. Word has length 102 [2024-10-12 21:44:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:07,439 INFO L471 AbstractCegarLoop]: Abstraction has 5012 states and 6337 transitions. [2024-10-12 21:44:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5012 states and 6337 transitions. [2024-10-12 21:44:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:07,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:07,442 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] [2024-10-12 21:44:07,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:44:07,442 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:07,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 695237896, now seen corresponding path program 1 times [2024-10-12 21:44:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:07,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570989150] [2024-10-12 21:44:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:07,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:07,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:07,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:07,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:07,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:07,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570989150] [2024-10-12 21:44:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570989150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:07,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333493363] [2024-10-12 21:44:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:07,544 INFO L87 Difference]: Start difference. First operand 5012 states and 6337 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:09,663 INFO L93 Difference]: Finished difference Result 7069 states and 9653 transitions. [2024-10-12 21:44:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:44:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:09,679 INFO L225 Difference]: With dead ends: 7069 [2024-10-12 21:44:09,680 INFO L226 Difference]: Without dead ends: 6268 [2024-10-12 21:44:09,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:44:09,683 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 991 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:09,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1522 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:44:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6268 states. [2024-10-12 21:44:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6268 to 5799. [2024-10-12 21:44:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5799 states, 4558 states have (on average 1.326020184291356) internal successors, (6044), 4635 states have internal predecessors, (6044), 645 states have call successors, (645), 472 states have call predecessors, (645), 594 states have return successors, (895), 701 states have call predecessors, (895), 642 states have call successors, (895) [2024-10-12 21:44:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5799 states to 5799 states and 7584 transitions. [2024-10-12 21:44:10,380 INFO L78 Accepts]: Start accepts. Automaton has 5799 states and 7584 transitions. Word has length 102 [2024-10-12 21:44:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:10,380 INFO L471 AbstractCegarLoop]: Abstraction has 5799 states and 7584 transitions. [2024-10-12 21:44:10,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:10,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5799 states and 7584 transitions. [2024-10-12 21:44:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:10,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:10,383 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] [2024-10-12 21:44:10,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:44:10,383 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:10,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash -362600182, now seen corresponding path program 1 times [2024-10-12 21:44:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839364865] [2024-10-12 21:44:10,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:10,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:10,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:10,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:10,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:10,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:10,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:10,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839364865] [2024-10-12 21:44:10,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839364865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:10,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:10,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:10,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191690532] [2024-10-12 21:44:10,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:10,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:10,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:10,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:10,499 INFO L87 Difference]: Start difference. First operand 5799 states and 7584 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:13,210 INFO L93 Difference]: Finished difference Result 10488 states and 15138 transitions. [2024-10-12 21:44:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:44:13,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:13,230 INFO L225 Difference]: With dead ends: 10488 [2024-10-12 21:44:13,230 INFO L226 Difference]: Without dead ends: 8900 [2024-10-12 21:44:13,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:44:13,237 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 1053 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:13,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1517 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:44:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8900 states. [2024-10-12 21:44:14,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8900 to 7364. [2024-10-12 21:44:14,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7364 states, 5955 states have (on average 1.385054575986566) internal successors, (8248), 6040 states have internal predecessors, (8248), 757 states have call successors, (757), 520 states have call predecessors, (757), 650 states have return successors, (1077), 821 states have call predecessors, (1077), 754 states have call successors, (1077) [2024-10-12 21:44:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 10082 transitions. [2024-10-12 21:44:14,050 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 10082 transitions. Word has length 102 [2024-10-12 21:44:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:14,050 INFO L471 AbstractCegarLoop]: Abstraction has 7364 states and 10082 transitions. [2024-10-12 21:44:14,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:14,050 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 10082 transitions. [2024-10-12 21:44:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:14,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:14,053 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] [2024-10-12 21:44:14,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:44:14,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:14,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1505102648, now seen corresponding path program 1 times [2024-10-12 21:44:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279365585] [2024-10-12 21:44:14,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:14,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:14,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:14,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:14,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:14,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279365585] [2024-10-12 21:44:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279365585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:14,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:14,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767597999] [2024-10-12 21:44:14,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:14,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:14,149 INFO L87 Difference]: Start difference. First operand 7364 states and 10082 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:15,612 INFO L93 Difference]: Finished difference Result 11414 states and 16687 transitions. [2024-10-12 21:44:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:15,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:15,631 INFO L225 Difference]: With dead ends: 11414 [2024-10-12 21:44:15,631 INFO L226 Difference]: Without dead ends: 8259 [2024-10-12 21:44:15,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:44:15,637 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 947 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:15,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 729 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:44:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8259 states. [2024-10-12 21:44:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8259 to 7364. [2024-10-12 21:44:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7364 states, 5955 states have (on average 1.3821998320738875) internal successors, (8231), 6040 states have internal predecessors, (8231), 757 states have call successors, (757), 520 states have call predecessors, (757), 650 states have return successors, (1077), 821 states have call predecessors, (1077), 754 states have call successors, (1077) [2024-10-12 21:44:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7364 states to 7364 states and 10065 transitions. [2024-10-12 21:44:16,455 INFO L78 Accepts]: Start accepts. Automaton has 7364 states and 10065 transitions. Word has length 102 [2024-10-12 21:44:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:16,455 INFO L471 AbstractCegarLoop]: Abstraction has 7364 states and 10065 transitions. [2024-10-12 21:44:16,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 7364 states and 10065 transitions. [2024-10-12 21:44:16,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:16,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:16,458 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] [2024-10-12 21:44:16,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:44:16,458 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:16,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:16,459 INFO L85 PathProgramCache]: Analyzing trace with hash -666068986, now seen corresponding path program 1 times [2024-10-12 21:44:16,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:16,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640092093] [2024-10-12 21:44:16,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:16,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:16,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640092093] [2024-10-12 21:44:16,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640092093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:16,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:16,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:16,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598756132] [2024-10-12 21:44:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:16,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:16,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:16,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:16,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:16,561 INFO L87 Difference]: Start difference. First operand 7364 states and 10065 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:18,929 INFO L93 Difference]: Finished difference Result 16063 states and 24086 transitions. [2024-10-12 21:44:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:44:18,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:18,960 INFO L225 Difference]: With dead ends: 16063 [2024-10-12 21:44:18,960 INFO L226 Difference]: Without dead ends: 12910 [2024-10-12 21:44:18,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:44:18,970 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1136 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:18,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1435 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:44:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12910 states. [2024-10-12 21:44:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12910 to 10525. [2024-10-12 21:44:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10525 states, 8788 states have (on average 1.443445607646791) internal successors, (12685), 8889 states have internal predecessors, (12685), 973 states have call successors, (973), 616 states have call predecessors, (973), 762 states have return successors, (1487), 1053 states have call predecessors, (1487), 970 states have call successors, (1487) [2024-10-12 21:44:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10525 states to 10525 states and 15145 transitions. [2024-10-12 21:44:20,026 INFO L78 Accepts]: Start accepts. Automaton has 10525 states and 15145 transitions. Word has length 102 [2024-10-12 21:44:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:20,027 INFO L471 AbstractCegarLoop]: Abstraction has 10525 states and 15145 transitions. [2024-10-12 21:44:20,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 10525 states and 15145 transitions. [2024-10-12 21:44:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:20,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:20,033 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] [2024-10-12 21:44:20,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:44:20,033 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -639003384, now seen corresponding path program 1 times [2024-10-12 21:44:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:20,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245519498] [2024-10-12 21:44:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:20,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:20,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:20,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:20,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245519498] [2024-10-12 21:44:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245519498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212332004] [2024-10-12 21:44:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:20,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:20,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:20,134 INFO L87 Difference]: Start difference. First operand 10525 states and 15145 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:23,062 INFO L93 Difference]: Finished difference Result 27386 states and 42496 transitions. [2024-10-12 21:44:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:44:23,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:23,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:23,106 INFO L225 Difference]: With dead ends: 27386 [2024-10-12 21:44:23,106 INFO L226 Difference]: Without dead ends: 21072 [2024-10-12 21:44:23,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:44:23,120 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1091 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:23,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1514 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:44:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21072 states. [2024-10-12 21:44:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21072 to 16847. [2024-10-12 21:44:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16847 states, 14470 states have (on average 1.4944713199723565) internal successors, (21625), 14603 states have internal predecessors, (21625), 1389 states have call successors, (1389), 808 states have call predecessors, (1389), 986 states have return successors, (2453), 1501 states have call predecessors, (2453), 1386 states have call successors, (2453) [2024-10-12 21:44:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16847 states to 16847 states and 25467 transitions. [2024-10-12 21:44:24,914 INFO L78 Accepts]: Start accepts. Automaton has 16847 states and 25467 transitions. Word has length 102 [2024-10-12 21:44:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:24,914 INFO L471 AbstractCegarLoop]: Abstraction has 16847 states and 25467 transitions. [2024-10-12 21:44:24,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 16847 states and 25467 transitions. [2024-10-12 21:44:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:24,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:24,922 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] [2024-10-12 21:44:24,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:44:24,922 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1578627014, now seen corresponding path program 1 times [2024-10-12 21:44:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736021586] [2024-10-12 21:44:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:24,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:25,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736021586] [2024-10-12 21:44:25,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736021586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:25,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:25,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:25,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763399276] [2024-10-12 21:44:25,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:25,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:25,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:25,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:25,026 INFO L87 Difference]: Start difference. First operand 16847 states and 25467 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:27,281 INFO L93 Difference]: Finished difference Result 32604 states and 51633 transitions. [2024-10-12 21:44:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:27,331 INFO L225 Difference]: With dead ends: 32604 [2024-10-12 21:44:27,331 INFO L226 Difference]: Without dead ends: 19966 [2024-10-12 21:44:27,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:44:27,358 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 947 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:27,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 729 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:44:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19966 states. [2024-10-12 21:44:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19966 to 16847. [2024-10-12 21:44:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16847 states, 14470 states have (on average 1.4899792674498964) internal successors, (21560), 14603 states have internal predecessors, (21560), 1389 states have call successors, (1389), 808 states have call predecessors, (1389), 986 states have return successors, (2453), 1501 states have call predecessors, (2453), 1386 states have call successors, (2453) [2024-10-12 21:44:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16847 states to 16847 states and 25402 transitions. [2024-10-12 21:44:28,869 INFO L78 Accepts]: Start accepts. Automaton has 16847 states and 25402 transitions. Word has length 102 [2024-10-12 21:44:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:28,869 INFO L471 AbstractCegarLoop]: Abstraction has 16847 states and 25402 transitions. [2024-10-12 21:44:28,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 16847 states and 25402 transitions. [2024-10-12 21:44:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:28,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:28,876 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] [2024-10-12 21:44:28,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:44:28,876 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:28,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash -982235832, now seen corresponding path program 1 times [2024-10-12 21:44:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:28,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104942634] [2024-10-12 21:44:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:28,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:29,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:29,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:29,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:29,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104942634] [2024-10-12 21:44:29,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104942634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:29,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:29,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593504423] [2024-10-12 21:44:29,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:29,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:29,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:29,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:29,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:29,027 INFO L87 Difference]: Start difference. First operand 16847 states and 25402 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:33,385 INFO L93 Difference]: Finished difference Result 48720 states and 77530 transitions. [2024-10-12 21:44:33,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:44:33,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:33,470 INFO L225 Difference]: With dead ends: 48720 [2024-10-12 21:44:33,470 INFO L226 Difference]: Without dead ends: 36084 [2024-10-12 21:44:33,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:44:33,496 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 1015 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:33,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1515 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:44:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36084 states. [2024-10-12 21:44:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36084 to 29555. [2024-10-12 21:44:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29555 states, 25930 states have (on average 1.5234863092942537) internal successors, (39504), 26127 states have internal predecessors, (39504), 2189 states have call successors, (2189), 1192 states have call predecessors, (2189), 1434 states have return successors, (4839), 2365 states have call predecessors, (4839), 2186 states have call successors, (4839) [2024-10-12 21:44:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29555 states to 29555 states and 46532 transitions. [2024-10-12 21:44:35,943 INFO L78 Accepts]: Start accepts. Automaton has 29555 states and 46532 transitions. Word has length 102 [2024-10-12 21:44:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:35,943 INFO L471 AbstractCegarLoop]: Abstraction has 29555 states and 46532 transitions. [2024-10-12 21:44:35,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 29555 states and 46532 transitions. [2024-10-12 21:44:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:35,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:35,956 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] [2024-10-12 21:44:35,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 21:44:35,956 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:35,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash -95012986, now seen corresponding path program 1 times [2024-10-12 21:44:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:35,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231413627] [2024-10-12 21:44:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:35,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:35,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:35,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:36,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231413627] [2024-10-12 21:44:36,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231413627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:36,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:36,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:44:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417193358] [2024-10-12 21:44:36,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:36,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:44:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:36,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:44:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:44:36,034 INFO L87 Difference]: Start difference. First operand 29555 states and 46532 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:39,687 INFO L93 Difference]: Finished difference Result 60770 states and 97990 transitions. [2024-10-12 21:44:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:44:39,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:39,772 INFO L225 Difference]: With dead ends: 60770 [2024-10-12 21:44:39,772 INFO L226 Difference]: Without dead ends: 35426 [2024-10-12 21:44:39,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 21:44:39,814 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 364 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:39,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 992 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:44:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35426 states. [2024-10-12 21:44:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35426 to 29811. [2024-10-12 21:44:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29811 states, 26186 states have (on average 1.5183685939051401) internal successors, (39760), 26383 states have internal predecessors, (39760), 2189 states have call successors, (2189), 1192 states have call predecessors, (2189), 1434 states have return successors, (4839), 2365 states have call predecessors, (4839), 2186 states have call successors, (4839) [2024-10-12 21:44:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29811 states to 29811 states and 46788 transitions. [2024-10-12 21:44:42,417 INFO L78 Accepts]: Start accepts. Automaton has 29811 states and 46788 transitions. Word has length 102 [2024-10-12 21:44:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:44:42,417 INFO L471 AbstractCegarLoop]: Abstraction has 29811 states and 46788 transitions. [2024-10-12 21:44:42,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 29811 states and 46788 transitions. [2024-10-12 21:44:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 21:44:42,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:44:42,431 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] [2024-10-12 21:44:42,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:44:42,431 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:44:42,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:44:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash -826980412, now seen corresponding path program 1 times [2024-10-12 21:44:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:44:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406784702] [2024-10-12 21:44:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:44:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:44:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:42,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:44:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 21:44:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 21:44:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:42,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 21:44:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 21:44:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:44:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:44:42,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:44:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406784702] [2024-10-12 21:44:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406784702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:44:42,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:44:42,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:44:42,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421418699] [2024-10-12 21:44:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:44:42,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:44:42,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:44:42,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:44:42,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:44:42,545 INFO L87 Difference]: Start difference. First operand 29811 states and 46788 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:44:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:44:53,682 INFO L93 Difference]: Finished difference Result 147613 states and 243626 transitions. [2024-10-12 21:44:53,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 21:44:53,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-10-12 21:44:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:44:54,019 INFO L225 Difference]: With dead ends: 147613 [2024-10-12 21:44:54,019 INFO L226 Difference]: Without dead ends: 122013 [2024-10-12 21:44:54,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-12 21:44:54,107 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 2439 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:44:54,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 1257 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 2110 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 21:44:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122013 states.