./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.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc8dc9bdb034e5a733c81076f9e42c36caa1eb5cb68a77287d3420bd964c5f5a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:09:59,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:09:59,411 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:09:59,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:09:59,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:09:59,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:09:59,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:09:59,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:09:59,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:09:59,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:09:59,461 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:09:59,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:09:59,462 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:09:59,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:09:59,464 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:09:59,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:09:59,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:09:59,465 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:09:59,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:09:59,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:09:59,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:09:59,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:09:59,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:09:59,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:09:59,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:09:59,470 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:09:59,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:09:59,470 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:09:59,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:09:59,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:09:59,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:09:59,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:09:59,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:09:59,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:09:59,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:09:59,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:09:59,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:09:59,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:09:59,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:09:59,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:09:59,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:09:59,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:09:59,474 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 -> dc8dc9bdb034e5a733c81076f9e42c36caa1eb5cb68a77287d3420bd964c5f5a [2024-11-20 00:09:59,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:09:59,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:09:59,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:09:59,760 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:09:59,760 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:09:59,761 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.15.cil.c [2024-11-20 00:10:01,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:10:01,519 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:10:01,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.c [2024-11-20 00:10:01,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36afbc058/3368e523bfaa4f42898642cb8cd0f478/FLAG1dbbc37a2 [2024-11-20 00:10:01,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36afbc058/3368e523bfaa4f42898642cb8cd0f478 [2024-11-20 00:10:01,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:10:01,567 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:10:01,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:10:01,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:10:01,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:10:01,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:10:01" (1/1) ... [2024-11-20 00:10:01,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb08dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:01, skipping insertion in model container [2024-11-20 00:10:01,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:10:01" (1/1) ... [2024-11-20 00:10:01,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:10:01,838 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.c[914,927] [2024-11-20 00:10:01,901 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.c[7115,7128] [2024-11-20 00:10:02,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:10:02,024 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:10:02,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.c[914,927] [2024-11-20 00:10:02,049 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.15.cil.c[7115,7128] [2024-11-20 00:10:02,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:10:02,141 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:10:02,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02 WrapperNode [2024-11-20 00:10:02,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:10:02,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:10:02,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:10:02,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:10:02,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,257 INFO L138 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1132 [2024-11-20 00:10:02,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:10:02,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:10:02,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:10:02,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:10:02,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,321 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 00:10:02,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:10:02,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:10:02,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:10:02,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:10:02,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (1/1) ... [2024-11-20 00:10:02,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:10:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:02,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 00:10:02,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 00:10:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:10:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:10:02,477 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:10:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:10:02,479 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:10:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:10:02,479 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:10:02,479 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:10:02,479 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:10:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:10:02,480 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:10:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:10:02,480 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:10:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:10:02,480 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:10:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:10:02,481 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:10:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:10:02,481 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:10:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:10:02,481 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:10:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:10:02,482 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:10:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:10:02,482 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:10:02,483 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:10:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:10:02,483 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:10:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:10:02,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:10:02,483 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:10:02,483 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:10:02,484 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-20 00:10:02,484 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-20 00:10:02,650 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:10:02,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:10:03,853 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-20 00:10:03,853 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:10:03,889 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:10:03,889 INFO L316 CfgBuilder]: Removed 20 assume(true) statements. [2024-11-20 00:10:03,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:10:03 BoogieIcfgContainer [2024-11-20 00:10:03,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:10:03,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:10:03,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:10:03,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:10:03,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:10:01" (1/3) ... [2024-11-20 00:10:03,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779e0830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:10:03, skipping insertion in model container [2024-11-20 00:10:03,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:10:02" (2/3) ... [2024-11-20 00:10:03,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779e0830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:10:03, skipping insertion in model container [2024-11-20 00:10:03,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:10:03" (3/3) ... [2024-11-20 00:10:03,901 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.15.cil.c [2024-11-20 00:10:03,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:10:03,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:10:04,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:10:04,009 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;@45c42a3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:10:04,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:10:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 467 states have (on average 1.6274089935760172) internal successors, (760), 475 states have internal predecessors, (760), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-20 00:10:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:04,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:04,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:04,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:04,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash -34087819, now seen corresponding path program 1 times [2024-11-20 00:10:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:04,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689669915] [2024-11-20 00:10:04,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:04,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:04,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:04,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:04,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689669915] [2024-11-20 00:10:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689669915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:04,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:04,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:10:04,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255725807] [2024-11-20 00:10:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:04,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:10:04,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:04,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:10:04,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:04,659 INFO L87 Difference]: Start difference. First operand has 528 states, 467 states have (on average 1.6274089935760172) internal successors, (760), 475 states have internal predecessors, (760), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:10:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:06,252 INFO L93 Difference]: Finished difference Result 1161 states and 1848 transitions. [2024-11-20 00:10:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:06,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-20 00:10:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:06,272 INFO L225 Difference]: With dead ends: 1161 [2024-11-20 00:10:06,272 INFO L226 Difference]: Without dead ends: 652 [2024-11-20 00:10:06,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:10:06,285 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 1657 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:06,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 1983 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:10:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-20 00:10:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 613. [2024-11-20 00:10:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 535 states have (on average 1.519626168224299) internal successors, (813), 542 states have internal predecessors, (813), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-11-20 00:10:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 922 transitions. [2024-11-20 00:10:06,395 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 922 transitions. Word has length 65 [2024-11-20 00:10:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 922 transitions. [2024-11-20 00:10:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:10:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 922 transitions. [2024-11-20 00:10:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:06,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:06,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:06,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:10:06,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:06,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:06,403 INFO L85 PathProgramCache]: Analyzing trace with hash 369698132, now seen corresponding path program 1 times [2024-11-20 00:10:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:06,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943441969] [2024-11-20 00:10:06,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:06,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:06,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:06,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:06,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943441969] [2024-11-20 00:10:06,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943441969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:06,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:06,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:06,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282137167] [2024-11-20 00:10:06,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:06,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:06,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:06,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:06,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:06,621 INFO L87 Difference]: Start difference. First operand 613 states and 922 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:10:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:08,103 INFO L93 Difference]: Finished difference Result 825 states and 1213 transitions. [2024-11-20 00:10:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:08,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-20 00:10:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:08,108 INFO L225 Difference]: With dead ends: 825 [2024-11-20 00:10:08,109 INFO L226 Difference]: Without dead ends: 648 [2024-11-20 00:10:08,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:10:08,111 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 691 mSDsluCounter, 2717 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 3166 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:08,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 3166 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2104 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:10:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-11-20 00:10:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 618. [2024-11-20 00:10:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 539 states have (on average 1.5139146567717996) internal successors, (816), 546 states have internal predecessors, (816), 54 states have call successors, (54), 22 states have call predecessors, (54), 23 states have return successors, (56), 52 states have call predecessors, (56), 50 states have call successors, (56) [2024-11-20 00:10:08,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 926 transitions. [2024-11-20 00:10:08,166 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 926 transitions. Word has length 65 [2024-11-20 00:10:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:08,166 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 926 transitions. [2024-11-20 00:10:08,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:10:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 926 transitions. [2024-11-20 00:10:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:08,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:08,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:08,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:10:08,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:08,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash -659661166, now seen corresponding path program 1 times [2024-11-20 00:10:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:08,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207265374] [2024-11-20 00:10:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:08,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:08,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207265374] [2024-11-20 00:10:08,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207265374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:08,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:08,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559157494] [2024-11-20 00:10:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:08,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:08,413 INFO L87 Difference]: Start difference. First operand 618 states and 926 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:10,453 INFO L93 Difference]: Finished difference Result 1792 states and 2518 transitions. [2024-11-20 00:10:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-20 00:10:10,454 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-20 00:10:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:10,470 INFO L225 Difference]: With dead ends: 1792 [2024-11-20 00:10:10,472 INFO L226 Difference]: Without dead ends: 1610 [2024-11-20 00:10:10,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 00:10:10,475 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 2839 mSDsluCounter, 2214 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:10,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 2783 Invalid, 2475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 00:10:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2024-11-20 00:10:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1368. [2024-11-20 00:10:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1132 states have (on average 1.4151943462897527) internal successors, (1602), 1149 states have internal predecessors, (1602), 132 states have call successors, (132), 90 states have call predecessors, (132), 102 states have return successors, (169), 131 states have call predecessors, (169), 128 states have call successors, (169) [2024-11-20 00:10:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1903 transitions. [2024-11-20 00:10:10,608 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1903 transitions. Word has length 65 [2024-11-20 00:10:10,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:10,609 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 1903 transitions. [2024-11-20 00:10:10,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-20 00:10:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1903 transitions. [2024-11-20 00:10:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:10,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:10,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:10:10,612 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash 391787923, now seen corresponding path program 1 times [2024-11-20 00:10:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:10,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235369959] [2024-11-20 00:10:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:10,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235369959] [2024-11-20 00:10:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235369959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:10,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:10,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933366486] [2024-11-20 00:10:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:10,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:10,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:10,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:10,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:10,813 INFO L87 Difference]: Start difference. First operand 1368 states and 1903 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:10:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:11,977 INFO L93 Difference]: Finished difference Result 2494 states and 3390 transitions. [2024-11-20 00:10:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:10:11,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-20 00:10:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:11,991 INFO L225 Difference]: With dead ends: 2494 [2024-11-20 00:10:11,991 INFO L226 Difference]: Without dead ends: 1562 [2024-11-20 00:10:11,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:10:11,994 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 1032 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:11,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 2800 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:10:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2024-11-20 00:10:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1398. [2024-11-20 00:10:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1156 states have (on average 1.4013840830449826) internal successors, (1620), 1173 states have internal predecessors, (1620), 132 states have call successors, (132), 90 states have call predecessors, (132), 108 states have return successors, (177), 137 states have call predecessors, (177), 128 states have call successors, (177) [2024-11-20 00:10:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1929 transitions. [2024-11-20 00:10:12,085 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1929 transitions. Word has length 65 [2024-11-20 00:10:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:12,087 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1929 transitions. [2024-11-20 00:10:12,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:10:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1929 transitions. [2024-11-20 00:10:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:12,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:12,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:12,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:10:12,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:12,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:12,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1777991317, now seen corresponding path program 1 times [2024-11-20 00:10:12,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:12,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764550155] [2024-11-20 00:10:12,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:12,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:12,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:12,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:12,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:12,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:12,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764550155] [2024-11-20 00:10:12,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764550155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:12,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:12,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:10:12,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289959240] [2024-11-20 00:10:12,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:12,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:10:12,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:12,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:10:12,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:12,304 INFO L87 Difference]: Start difference. First operand 1398 states and 1929 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:10:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:13,751 INFO L93 Difference]: Finished difference Result 3057 states and 4082 transitions. [2024-11-20 00:10:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:10:13,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-20 00:10:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:13,765 INFO L225 Difference]: With dead ends: 3057 [2024-11-20 00:10:13,765 INFO L226 Difference]: Without dead ends: 2097 [2024-11-20 00:10:13,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:10:13,769 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 1551 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 2304 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:13,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 2304 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:10:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2024-11-20 00:10:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 1889. [2024-11-20 00:10:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1543 states have (on average 1.370706416072586) internal successors, (2115), 1572 states have internal predecessors, (2115), 182 states have call successors, (182), 131 states have call predecessors, (182), 162 states have return successors, (271), 189 states have call predecessors, (271), 178 states have call successors, (271) [2024-11-20 00:10:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2568 transitions. [2024-11-20 00:10:13,889 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2568 transitions. Word has length 65 [2024-11-20 00:10:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:13,890 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2568 transitions. [2024-11-20 00:10:13,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:10:13,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2568 transitions. [2024-11-20 00:10:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:10:13,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:13,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:13,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:10:13,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:13,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1643977811, now seen corresponding path program 1 times [2024-11-20 00:10:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:13,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423465189] [2024-11-20 00:10:13,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:13,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:13,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:13,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:14,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:14,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423465189] [2024-11-20 00:10:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423465189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:14,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:14,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404931587] [2024-11-20 00:10:14,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:14,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:14,020 INFO L87 Difference]: Start difference. First operand 1889 states and 2568 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:10:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:14,974 INFO L93 Difference]: Finished difference Result 4964 states and 6571 transitions. [2024-11-20 00:10:14,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:10:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-20 00:10:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:14,991 INFO L225 Difference]: With dead ends: 4964 [2024-11-20 00:10:14,991 INFO L226 Difference]: Without dead ends: 3520 [2024-11-20 00:10:15,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:10:15,014 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 2280 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:15,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 1194 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3520 states. [2024-11-20 00:10:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3520 to 3272. [2024-11-20 00:10:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 2615 states have (on average 1.3170172084130018) internal successors, (3444), 2671 states have internal predecessors, (3444), 334 states have call successors, (334), 254 states have call predecessors, (334), 321 states have return successors, (557), 353 states have call predecessors, (557), 330 states have call successors, (557) [2024-11-20 00:10:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4335 transitions. [2024-11-20 00:10:15,219 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4335 transitions. Word has length 65 [2024-11-20 00:10:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:15,219 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 4335 transitions. [2024-11-20 00:10:15,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:10:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4335 transitions. [2024-11-20 00:10:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:10:15,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:15,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:15,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:10:15,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:15,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash 106133636, now seen corresponding path program 1 times [2024-11-20 00:10:15,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280384972] [2024-11-20 00:10:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280384972] [2024-11-20 00:10:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280384972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:15,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:15,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:15,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558097152] [2024-11-20 00:10:15,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:15,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:15,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:15,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:15,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:15,332 INFO L87 Difference]: Start difference. First operand 3272 states and 4335 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:10:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:16,384 INFO L93 Difference]: Finished difference Result 8294 states and 10897 transitions. [2024-11-20 00:10:16,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:16,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-20 00:10:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:16,412 INFO L225 Difference]: With dead ends: 8294 [2024-11-20 00:10:16,413 INFO L226 Difference]: Without dead ends: 5446 [2024-11-20 00:10:16,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:16,422 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 1249 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:16,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 1574 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5446 states. [2024-11-20 00:10:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5446 to 4966. [2024-11-20 00:10:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4966 states, 3906 states have (on average 1.2944188428059396) internal successors, (5056), 3975 states have internal predecessors, (5056), 532 states have call successors, (532), 428 states have call predecessors, (532), 526 states have return successors, (892), 569 states have call predecessors, (892), 528 states have call successors, (892) [2024-11-20 00:10:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4966 states to 4966 states and 6480 transitions. [2024-11-20 00:10:16,797 INFO L78 Accepts]: Start accepts. Automaton has 4966 states and 6480 transitions. Word has length 66 [2024-11-20 00:10:16,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:16,797 INFO L471 AbstractCegarLoop]: Abstraction has 4966 states and 6480 transitions. [2024-11-20 00:10:16,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:10:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4966 states and 6480 transitions. [2024-11-20 00:10:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 00:10:16,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:16,800 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:16,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:10:16,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:16,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash -539690255, now seen corresponding path program 1 times [2024-11-20 00:10:16,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:16,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230408549] [2024-11-20 00:10:16,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:16,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230408549] [2024-11-20 00:10:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230408549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593749078] [2024-11-20 00:10:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:16,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:16,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:16,899 INFO L87 Difference]: Start difference. First operand 4966 states and 6480 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 00:10:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:18,060 INFO L93 Difference]: Finished difference Result 6560 states and 8460 transitions. [2024-11-20 00:10:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:10:18,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-20 00:10:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:18,092 INFO L225 Difference]: With dead ends: 6560 [2024-11-20 00:10:18,092 INFO L226 Difference]: Without dead ends: 6557 [2024-11-20 00:10:18,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-20 00:10:18,097 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 2642 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:18,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 1224 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:10:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6557 states. [2024-11-20 00:10:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6557 to 6032. [2024-11-20 00:10:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6032 states, 4715 states have (on average 1.280593849416755) internal successors, (6038), 4799 states have internal predecessors, (6038), 658 states have call successors, (658), 542 states have call predecessors, (658), 657 states have return successors, (1097), 697 states have call predecessors, (1097), 655 states have call successors, (1097) [2024-11-20 00:10:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 7793 transitions. [2024-11-20 00:10:18,634 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 7793 transitions. Word has length 73 [2024-11-20 00:10:18,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:18,635 INFO L471 AbstractCegarLoop]: Abstraction has 6032 states and 7793 transitions. [2024-11-20 00:10:18,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 00:10:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 7793 transitions. [2024-11-20 00:10:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 00:10:18,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:18,639 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:18,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:10:18,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash 447934445, now seen corresponding path program 1 times [2024-11-20 00:10:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942357923] [2024-11-20 00:10:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:18,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942357923] [2024-11-20 00:10:18,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942357923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:18,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508699090] [2024-11-20 00:10:18,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:18,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:18,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:18,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:10:18,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 00:10:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:18,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 00:10:18,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:19,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:10:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508699090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:10:19,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:10:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-20 00:10:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502044417] [2024-11-20 00:10:19,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:10:19,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 00:10:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 00:10:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:10:19,373 INFO L87 Difference]: Start difference. First operand 6032 states and 7793 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-20 00:10:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:21,884 INFO L93 Difference]: Finished difference Result 13630 states and 17327 transitions. [2024-11-20 00:10:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 00:10:21,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-20 00:10:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:21,943 INFO L225 Difference]: With dead ends: 13630 [2024-11-20 00:10:21,943 INFO L226 Difference]: Without dead ends: 13627 [2024-11-20 00:10:21,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-20 00:10:21,952 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 2023 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 2767 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:21,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 2767 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:10:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13627 states. [2024-11-20 00:10:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13627 to 11330. [2024-11-20 00:10:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11330 states, 8827 states have (on average 1.2673615044749065) internal successors, (11187), 8983 states have internal predecessors, (11187), 1224 states have call successors, (1224), 1032 states have call predecessors, (1224), 1277 states have return successors, (2076), 1321 states have call predecessors, (2076), 1221 states have call successors, (2076) [2024-11-20 00:10:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11330 states to 11330 states and 14487 transitions. [2024-11-20 00:10:23,033 INFO L78 Accepts]: Start accepts. Automaton has 11330 states and 14487 transitions. Word has length 74 [2024-11-20 00:10:23,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:23,033 INFO L471 AbstractCegarLoop]: Abstraction has 11330 states and 14487 transitions. [2024-11-20 00:10:23,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-20 00:10:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 11330 states and 14487 transitions. [2024-11-20 00:10:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 00:10:23,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:23,039 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:23,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 00:10:23,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:23,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:23,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1772710799, now seen corresponding path program 2 times [2024-11-20 00:10:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914805942] [2024-11-20 00:10:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:23,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:23,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:23,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:23,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914805942] [2024-11-20 00:10:23,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914805942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:23,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:23,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372530890] [2024-11-20 00:10:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:23,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:23,320 INFO L87 Difference]: Start difference. First operand 11330 states and 14487 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 00:10:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:24,853 INFO L93 Difference]: Finished difference Result 17865 states and 22879 transitions. [2024-11-20 00:10:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:10:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-20 00:10:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:24,905 INFO L225 Difference]: With dead ends: 17865 [2024-11-20 00:10:24,906 INFO L226 Difference]: Without dead ends: 7847 [2024-11-20 00:10:24,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:10:24,937 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1763 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1799 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:24,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1799 Valid, 1297 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7847 states. [2024-11-20 00:10:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7847 to 7359. [2024-11-20 00:10:25,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7359 states, 5762 states have (on average 1.2500867754251996) internal successors, (7203), 5862 states have internal predecessors, (7203), 791 states have call successors, (791), 656 states have call predecessors, (791), 804 states have return successors, (1271), 847 states have call predecessors, (1271), 788 states have call successors, (1271) [2024-11-20 00:10:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7359 states to 7359 states and 9265 transitions. [2024-11-20 00:10:25,647 INFO L78 Accepts]: Start accepts. Automaton has 7359 states and 9265 transitions. Word has length 77 [2024-11-20 00:10:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:25,648 INFO L471 AbstractCegarLoop]: Abstraction has 7359 states and 9265 transitions. [2024-11-20 00:10:25,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 00:10:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 7359 states and 9265 transitions. [2024-11-20 00:10:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 00:10:25,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:25,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:25,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:10:25,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:25,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:25,653 INFO L85 PathProgramCache]: Analyzing trace with hash -276928801, now seen corresponding path program 1 times [2024-11-20 00:10:25,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:25,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109313923] [2024-11-20 00:10:25,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:25,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:10:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 00:10:25,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:25,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109313923] [2024-11-20 00:10:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109313923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:25,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:25,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:10:25,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043084849] [2024-11-20 00:10:25,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:25,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:10:25,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:25,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:10:25,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:25,769 INFO L87 Difference]: Start difference. First operand 7359 states and 9265 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 00:10:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:27,727 INFO L93 Difference]: Finished difference Result 21237 states and 26616 transitions. [2024-11-20 00:10:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 00:10:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-20 00:10:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:27,776 INFO L225 Difference]: With dead ends: 21237 [2024-11-20 00:10:27,776 INFO L226 Difference]: Without dead ends: 14330 [2024-11-20 00:10:27,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-20 00:10:27,792 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 1507 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 2064 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:27,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 2064 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:10:27,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14330 states. [2024-11-20 00:10:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14330 to 13591. [2024-11-20 00:10:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13591 states, 10466 states have (on average 1.2178482705904834) internal successors, (12746), 10700 states have internal predecessors, (12746), 1511 states have call successors, (1511), 1260 states have call predecessors, (1511), 1612 states have return successors, (2736), 1643 states have call predecessors, (2736), 1508 states have call successors, (2736) [2024-11-20 00:10:29,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13591 states to 13591 states and 16993 transitions. [2024-11-20 00:10:29,153 INFO L78 Accepts]: Start accepts. Automaton has 13591 states and 16993 transitions. Word has length 84 [2024-11-20 00:10:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:29,154 INFO L471 AbstractCegarLoop]: Abstraction has 13591 states and 16993 transitions. [2024-11-20 00:10:29,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 00:10:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 13591 states and 16993 transitions. [2024-11-20 00:10:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 00:10:29,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:29,162 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:29,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:10:29,162 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:29,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash 630575919, now seen corresponding path program 1 times [2024-11-20 00:10:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:29,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051336685] [2024-11-20 00:10:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:10:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 00:10:29,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051336685] [2024-11-20 00:10:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051336685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:29,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:29,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:10:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348853241] [2024-11-20 00:10:29,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:29,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:10:29,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:10:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:29,321 INFO L87 Difference]: Start difference. First operand 13591 states and 16993 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 00:10:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:31,768 INFO L93 Difference]: Finished difference Result 24457 states and 30352 transitions. [2024-11-20 00:10:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 00:10:31,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-20 00:10:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:31,818 INFO L225 Difference]: With dead ends: 24457 [2024-11-20 00:10:31,818 INFO L226 Difference]: Without dead ends: 11944 [2024-11-20 00:10:31,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-20 00:10:31,851 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 2588 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2635 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:31,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2635 Valid, 2071 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:10:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11944 states. [2024-11-20 00:10:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11944 to 11094. [2024-11-20 00:10:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11094 states, 8597 states have (on average 1.208212167035012) internal successors, (10387), 8763 states have internal predecessors, (10387), 1210 states have call successors, (1210), 1009 states have call predecessors, (1210), 1285 states have return successors, (1995), 1331 states have call predecessors, (1995), 1207 states have call successors, (1995) [2024-11-20 00:10:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11094 states to 11094 states and 13592 transitions. [2024-11-20 00:10:32,808 INFO L78 Accepts]: Start accepts. Automaton has 11094 states and 13592 transitions. Word has length 93 [2024-11-20 00:10:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:32,808 INFO L471 AbstractCegarLoop]: Abstraction has 11094 states and 13592 transitions. [2024-11-20 00:10:32,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-20 00:10:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 11094 states and 13592 transitions. [2024-11-20 00:10:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 00:10:32,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:32,820 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:32,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 00:10:32,821 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:32,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1674276325, now seen corresponding path program 1 times [2024-11-20 00:10:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434790189] [2024-11-20 00:10:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:10:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 00:10:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 00:10:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 00:10:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 00:10:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 00:10:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 00:10:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-20 00:10:32,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:32,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434790189] [2024-11-20 00:10:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434790189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:32,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599018685] [2024-11-20 00:10:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:32,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:32,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:33,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:10:33,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 00:10:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:33,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 00:10:33,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-20 00:10:33,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:10:33,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599018685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:33,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:10:33,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-20 00:10:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473478251] [2024-11-20 00:10:33,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:33,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:33,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:33,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:33,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:10:33,175 INFO L87 Difference]: Start difference. First operand 11094 states and 13592 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 00:10:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:33,583 INFO L93 Difference]: Finished difference Result 16055 states and 19525 transitions. [2024-11-20 00:10:33,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 00:10:33,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-20 00:10:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:33,613 INFO L225 Difference]: With dead ends: 16055 [2024-11-20 00:10:33,613 INFO L226 Difference]: Without dead ends: 5423 [2024-11-20 00:10:33,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:10:33,638 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 0 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3916 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:33,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3916 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:10:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2024-11-20 00:10:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 5267. [2024-11-20 00:10:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 4206 states have (on average 1.2094626723728008) internal successors, (5087), 4257 states have internal predecessors, (5087), 518 states have call successors, (518), 415 states have call predecessors, (518), 541 states have return successors, (809), 595 states have call predecessors, (809), 515 states have call successors, (809) [2024-11-20 00:10:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 6414 transitions. [2024-11-20 00:10:34,018 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 6414 transitions. Word has length 145 [2024-11-20 00:10:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:34,019 INFO L471 AbstractCegarLoop]: Abstraction has 5267 states and 6414 transitions. [2024-11-20 00:10:34,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-20 00:10:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 6414 transitions. [2024-11-20 00:10:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 00:10:34,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:34,028 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:34,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 00:10:34,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-20 00:10:34,229 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:34,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1640362905, now seen corresponding path program 1 times [2024-11-20 00:10:34,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:34,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765268899] [2024-11-20 00:10:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:34,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:10:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 00:10:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 00:10:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 00:10:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 00:10:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 00:10:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 00:10:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-20 00:10:34,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:34,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765268899] [2024-11-20 00:10:34,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765268899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:34,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:34,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274566887] [2024-11-20 00:10:34,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:34,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:34,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:34,407 INFO L87 Difference]: Start difference. First operand 5267 states and 6414 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:10:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:35,278 INFO L93 Difference]: Finished difference Result 5805 states and 7024 transitions. [2024-11-20 00:10:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:35,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2024-11-20 00:10:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:35,301 INFO L225 Difference]: With dead ends: 5805 [2024-11-20 00:10:35,302 INFO L226 Difference]: Without dead ends: 5023 [2024-11-20 00:10:35,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:10:35,306 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 802 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:35,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1860 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:10:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2024-11-20 00:10:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4811. [2024-11-20 00:10:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4811 states, 3856 states have (on average 1.2144709543568464) internal successors, (4683), 3902 states have internal predecessors, (4683), 468 states have call successors, (468), 371 states have call predecessors, (468), 485 states have return successors, (738), 538 states have call predecessors, (738), 465 states have call successors, (738) [2024-11-20 00:10:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 5889 transitions. [2024-11-20 00:10:35,664 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 5889 transitions. Word has length 147 [2024-11-20 00:10:35,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:35,665 INFO L471 AbstractCegarLoop]: Abstraction has 4811 states and 5889 transitions. [2024-11-20 00:10:35,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-20 00:10:35,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 5889 transitions. [2024-11-20 00:10:35,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 00:10:35,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:35,674 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:35,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:10:35,674 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:35,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash -560976510, now seen corresponding path program 1 times [2024-11-20 00:10:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930182041] [2024-11-20 00:10:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 00:10:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:10:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:10:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 00:10:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 00:10:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 00:10:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 00:10:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 00:10:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 00:10:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 00:10:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 00:10:35,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:35,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930182041] [2024-11-20 00:10:35,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930182041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:35,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186885836] [2024-11-20 00:10:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:35,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:35,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:35,815 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:10:35,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 00:10:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:35,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 00:10:35,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-20 00:10:36,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:10:36,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186885836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:36,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:10:36,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-20 00:10:36,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874449236] [2024-11-20 00:10:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:36,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 00:10:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:36,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 00:10:36,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:36,079 INFO L87 Difference]: Start difference. First operand 4811 states and 5889 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 00:10:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:36,355 INFO L93 Difference]: Finished difference Result 6655 states and 8065 transitions. [2024-11-20 00:10:36,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 00:10:36,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2024-11-20 00:10:36,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:36,375 INFO L225 Difference]: With dead ends: 6655 [2024-11-20 00:10:36,375 INFO L226 Difference]: Without dead ends: 2570 [2024-11-20 00:10:36,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:10:36,385 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 695 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:36,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 888 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 00:10:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2024-11-20 00:10:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2570. [2024-11-20 00:10:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2098 states have (on average 1.2364156339370829) internal successors, (2594), 2123 states have internal predecessors, (2594), 235 states have call successors, (235), 179 states have call predecessors, (235), 235 states have return successors, (343), 268 states have call predecessors, (343), 232 states have call successors, (343) [2024-11-20 00:10:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3172 transitions. [2024-11-20 00:10:36,723 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3172 transitions. Word has length 158 [2024-11-20 00:10:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:36,724 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 3172 transitions. [2024-11-20 00:10:36,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 00:10:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3172 transitions. [2024-11-20 00:10:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 00:10:36,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:36,730 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:36,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 00:10:36,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:36,931 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:36,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1598815429, now seen corresponding path program 1 times [2024-11-20 00:10:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:36,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941416852] [2024-11-20 00:10:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:10:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 00:10:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 00:10:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 00:10:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-20 00:10:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-20 00:10:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 00:10:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-20 00:10:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:37,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941416852] [2024-11-20 00:10:37,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941416852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:37,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:37,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147266559] [2024-11-20 00:10:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:37,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:37,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:37,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:37,085 INFO L87 Difference]: Start difference. First operand 2570 states and 3172 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 00:10:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:38,373 INFO L93 Difference]: Finished difference Result 4436 states and 5384 transitions. [2024-11-20 00:10:38,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:10:38,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2024-11-20 00:10:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:38,388 INFO L225 Difference]: With dead ends: 4436 [2024-11-20 00:10:38,388 INFO L226 Difference]: Without dead ends: 2667 [2024-11-20 00:10:38,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:38,394 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 722 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 2385 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:38,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 2385 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:10:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2024-11-20 00:10:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2121. [2024-11-20 00:10:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1745 states have (on average 1.2544412607449857) internal successors, (2189), 1765 states have internal predecessors, (2189), 191 states have call successors, (191), 143 states have call predecessors, (191), 183 states have return successors, (267), 213 states have call predecessors, (267), 188 states have call successors, (267) [2024-11-20 00:10:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2647 transitions. [2024-11-20 00:10:38,695 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2647 transitions. Word has length 159 [2024-11-20 00:10:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:38,696 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2647 transitions. [2024-11-20 00:10:38,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-20 00:10:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2647 transitions. [2024-11-20 00:10:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-20 00:10:38,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:38,701 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:38,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:10:38,702 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:38,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash 782951110, now seen corresponding path program 1 times [2024-11-20 00:10:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:38,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753364833] [2024-11-20 00:10:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:10:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:10:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:10:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:10:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 00:10:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 00:10:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 00:10:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 00:10:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 00:10:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 00:10:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 00:10:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-20 00:10:39,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:39,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753364833] [2024-11-20 00:10:39,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753364833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:39,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350284706] [2024-11-20 00:10:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:39,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:39,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:39,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:10:39,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 00:10:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:39,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 00:10:39,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-20 00:10:39,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:10:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350284706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:39,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:10:39,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-20 00:10:39,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130947446] [2024-11-20 00:10:39,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 00:10:39,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:39,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 00:10:39,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:39,378 INFO L87 Difference]: Start difference. First operand 2121 states and 2647 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 00:10:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:40,186 INFO L93 Difference]: Finished difference Result 4719 states and 5766 transitions. [2024-11-20 00:10:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 00:10:40,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 162 [2024-11-20 00:10:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:40,203 INFO L225 Difference]: With dead ends: 4719 [2024-11-20 00:10:40,204 INFO L226 Difference]: Without dead ends: 2945 [2024-11-20 00:10:40,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:10:40,210 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 400 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:40,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1217 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:10:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2024-11-20 00:10:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2915. [2024-11-20 00:10:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2404 states have (on average 1.214226289517471) internal successors, (2919), 2429 states have internal predecessors, (2919), 257 states have call successors, (257), 191 states have call predecessors, (257), 252 states have return successors, (374), 295 states have call predecessors, (374), 254 states have call successors, (374) [2024-11-20 00:10:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 3550 transitions. [2024-11-20 00:10:40,584 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 3550 transitions. Word has length 162 [2024-11-20 00:10:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 3550 transitions. [2024-11-20 00:10:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 00:10:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 3550 transitions. [2024-11-20 00:10:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 00:10:40,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:40,590 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:40,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 00:10:40,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 00:10:40,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:40,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:40,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1489975161, now seen corresponding path program 1 times [2024-11-20 00:10:40,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:40,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166830197] [2024-11-20 00:10:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:40,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 00:10:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 00:10:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 00:10:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 00:10:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 00:10:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:10:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 00:10:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 00:10:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 00:10:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:10:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:10:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 00:10:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 00:10:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 00:10:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-20 00:10:40,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:40,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166830197] [2024-11-20 00:10:40,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166830197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:10:40,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438382915] [2024-11-20 00:10:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:10:40,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:10:40,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 00:10:40,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 00:10:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:41,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 00:10:41,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:10:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-20 00:10:41,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 00:10:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438382915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:41,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 00:10:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-20 00:10:41,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100755300] [2024-11-20 00:10:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:10:41,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:10:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:10:41,169 INFO L87 Difference]: Start difference. First operand 2915 states and 3550 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 00:10:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:42,016 INFO L93 Difference]: Finished difference Result 5298 states and 6321 transitions. [2024-11-20 00:10:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:42,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2024-11-20 00:10:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:42,029 INFO L225 Difference]: With dead ends: 5298 [2024-11-20 00:10:42,030 INFO L226 Difference]: Without dead ends: 2654 [2024-11-20 00:10:42,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-20 00:10:42,035 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 1069 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:42,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 1191 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:10:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2024-11-20 00:10:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2480. [2024-11-20 00:10:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2065 states have (on average 1.2227602905569008) internal successors, (2525), 2085 states have internal predecessors, (2525), 210 states have call successors, (210), 150 states have call predecessors, (210), 203 states have return successors, (293), 245 states have call predecessors, (293), 207 states have call successors, (293) [2024-11-20 00:10:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3028 transitions. [2024-11-20 00:10:42,251 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3028 transitions. Word has length 179 [2024-11-20 00:10:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:42,252 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3028 transitions. [2024-11-20 00:10:42,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-20 00:10:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3028 transitions. [2024-11-20 00:10:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:10:42,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:42,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:42,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 00:10:42,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 00:10:42,457 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:42,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:42,457 INFO L85 PathProgramCache]: Analyzing trace with hash -372771871, now seen corresponding path program 1 times [2024-11-20 00:10:42,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:42,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2250433] [2024-11-20 00:10:42,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:42,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:42,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:42,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:42,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:42,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-11-20 00:10:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:42,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2250433] [2024-11-20 00:10:42,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2250433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:42,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:42,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:10:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682162291] [2024-11-20 00:10:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:42,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:10:42,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:42,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:10:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:10:42,662 INFO L87 Difference]: Start difference. First operand 2480 states and 3028 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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-11-20 00:10:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:44,824 INFO L93 Difference]: Finished difference Result 3048 states and 3942 transitions. [2024-11-20 00:10:44,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:44,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 190 [2024-11-20 00:10:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:44,833 INFO L225 Difference]: With dead ends: 3048 [2024-11-20 00:10:44,833 INFO L226 Difference]: Without dead ends: 2633 [2024-11-20 00:10:44,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:44,835 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 1235 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:44,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 1079 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:10:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2024-11-20 00:10:45,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2480. [2024-11-20 00:10:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2065 states have (on average 1.22227602905569) internal successors, (2524), 2085 states have internal predecessors, (2524), 210 states have call successors, (210), 150 states have call predecessors, (210), 203 states have return successors, (293), 245 states have call predecessors, (293), 207 states have call successors, (293) [2024-11-20 00:10:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3027 transitions. [2024-11-20 00:10:45,180 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3027 transitions. Word has length 190 [2024-11-20 00:10:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:45,181 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3027 transitions. [2024-11-20 00:10:45,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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-11-20 00:10:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3027 transitions. [2024-11-20 00:10:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:10:45,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:45,183 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:45,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:10:45,183 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:45,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash 975361699, now seen corresponding path program 1 times [2024-11-20 00:10:45,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:45,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651278095] [2024-11-20 00:10:45,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:45,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:45,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:45,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:45,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:45,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:45,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:45,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651278095] [2024-11-20 00:10:45,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651278095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:45,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:45,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:10:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595231068] [2024-11-20 00:10:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:10:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:10:45,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:10:45,393 INFO L87 Difference]: Start difference. First operand 2480 states and 3027 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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-11-20 00:10:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:47,591 INFO L93 Difference]: Finished difference Result 3040 states and 3925 transitions. [2024-11-20 00:10:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:10:47,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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 190 [2024-11-20 00:10:47,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:47,600 INFO L225 Difference]: With dead ends: 3040 [2024-11-20 00:10:47,600 INFO L226 Difference]: Without dead ends: 2633 [2024-11-20 00:10:47,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:10:47,602 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 1226 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:47,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1077 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:10:47,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2024-11-20 00:10:47,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2480. [2024-11-20 00:10:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2065 states have (on average 1.2217917675544794) internal successors, (2523), 2085 states have internal predecessors, (2523), 210 states have call successors, (210), 150 states have call predecessors, (210), 203 states have return successors, (293), 245 states have call predecessors, (293), 207 states have call successors, (293) [2024-11-20 00:10:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3026 transitions. [2024-11-20 00:10:47,976 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3026 transitions. Word has length 190 [2024-11-20 00:10:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:47,976 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3026 transitions. [2024-11-20 00:10:47,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 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-11-20 00:10:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3026 transitions. [2024-11-20 00:10:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:10:47,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:47,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:47,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:10:47,979 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:47,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1806015333, now seen corresponding path program 1 times [2024-11-20 00:10:47,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:47,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461244899] [2024-11-20 00:10:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:47,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:48,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461244899] [2024-11-20 00:10:48,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461244899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:48,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:48,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:10:48,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940375484] [2024-11-20 00:10:48,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:48,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:10:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:10:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:10:48,219 INFO L87 Difference]: Start difference. First operand 2480 states and 3026 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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-11-20 00:10:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:51,300 INFO L93 Difference]: Finished difference Result 3606 states and 4837 transitions. [2024-11-20 00:10:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:10:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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 190 [2024-11-20 00:10:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:51,316 INFO L225 Difference]: With dead ends: 3606 [2024-11-20 00:10:51,317 INFO L226 Difference]: Without dead ends: 3206 [2024-11-20 00:10:51,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:10:51,320 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1916 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 2598 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:51,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 1655 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2598 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 00:10:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2024-11-20 00:10:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 2899. [2024-11-20 00:10:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2899 states, 2455 states have (on average 1.279022403258656) internal successors, (3140), 2476 states have internal predecessors, (3140), 232 states have call successors, (232), 156 states have call predecessors, (232), 210 states have return successors, (318), 267 states have call predecessors, (318), 229 states have call successors, (318) [2024-11-20 00:10:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 3690 transitions. [2024-11-20 00:10:51,731 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 3690 transitions. Word has length 190 [2024-11-20 00:10:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:51,731 INFO L471 AbstractCegarLoop]: Abstraction has 2899 states and 3690 transitions. [2024-11-20 00:10:51,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 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-11-20 00:10:51,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 3690 transitions. [2024-11-20 00:10:51,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:10:51,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:51,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:51,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:10:51,734 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:51,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash -41011103, now seen corresponding path program 1 times [2024-11-20 00:10:51,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:51,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833212342] [2024-11-20 00:10:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:51,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:52,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:52,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833212342] [2024-11-20 00:10:52,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833212342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:52,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:52,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:52,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407083936] [2024-11-20 00:10:52,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:52,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:52,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:52,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:52,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:52,012 INFO L87 Difference]: Start difference. First operand 2899 states and 3690 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:10:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:10:56,167 INFO L93 Difference]: Finished difference Result 4618 states and 6460 transitions. [2024-11-20 00:10:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:10:56,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:10:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:10:56,178 INFO L225 Difference]: With dead ends: 4618 [2024-11-20 00:10:56,178 INFO L226 Difference]: Without dead ends: 3799 [2024-11-20 00:10:56,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:10:56,181 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 1951 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 4104 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:10:56,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1981 Valid, 3069 Invalid, 4205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4104 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-20 00:10:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3799 states. [2024-11-20 00:10:56,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3799 to 3289. [2024-11-20 00:10:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 2816 states have (on average 1.3135653409090908) internal successors, (3699), 2838 states have internal predecessors, (3699), 254 states have call successors, (254), 162 states have call predecessors, (254), 217 states have return successors, (342), 290 states have call predecessors, (342), 251 states have call successors, (342) [2024-11-20 00:10:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4295 transitions. [2024-11-20 00:10:56,577 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4295 transitions. Word has length 190 [2024-11-20 00:10:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:10:56,577 INFO L471 AbstractCegarLoop]: Abstraction has 3289 states and 4295 transitions. [2024-11-20 00:10:56,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:10:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4295 transitions. [2024-11-20 00:10:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:10:56,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:10:56,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:10:56,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:10:56,579 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:10:56,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:10:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1964261533, now seen corresponding path program 1 times [2024-11-20 00:10:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:10:56,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111761455] [2024-11-20 00:10:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:10:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:10:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:10:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:10:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:10:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:10:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:10:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:10:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:10:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:10:56,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111761455] [2024-11-20 00:10:56,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111761455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:10:56,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:10:56,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:10:56,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584732935] [2024-11-20 00:10:56,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:10:56,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:10:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:10:56,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:10:56,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:10:56,849 INFO L87 Difference]: Start difference. First operand 3289 states and 4295 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:11:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:01,099 INFO L93 Difference]: Finished difference Result 6111 states and 8833 transitions. [2024-11-20 00:11:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:11:01,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:11:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:01,119 INFO L225 Difference]: With dead ends: 6111 [2024-11-20 00:11:01,119 INFO L226 Difference]: Without dead ends: 4902 [2024-11-20 00:11:01,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:11:01,127 INFO L432 NwaCegarLoop]: 689 mSDtfsCounter, 1949 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 4100 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 4203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 4100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:01,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1979 Valid, 3067 Invalid, 4203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 4100 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-20 00:11:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2024-11-20 00:11:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4070. [2024-11-20 00:11:01,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4070 states, 3539 states have (on average 1.3614015258547612) internal successors, (4818), 3563 states have internal predecessors, (4818), 298 states have call successors, (298), 174 states have call predecessors, (298), 231 states have return successors, (394), 336 states have call predecessors, (394), 295 states have call successors, (394) [2024-11-20 00:11:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 5510 transitions. [2024-11-20 00:11:01,553 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 5510 transitions. Word has length 190 [2024-11-20 00:11:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:01,554 INFO L471 AbstractCegarLoop]: Abstraction has 4070 states and 5510 transitions. [2024-11-20 00:11:01,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:11:01,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 5510 transitions. [2024-11-20 00:11:01,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:11:01,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:01,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:01,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:11:01,557 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:01,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:01,557 INFO L85 PathProgramCache]: Analyzing trace with hash 606097441, now seen corresponding path program 1 times [2024-11-20 00:11:01,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:01,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764101636] [2024-11-20 00:11:01,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:01,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:11:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:11:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:11:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:01,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764101636] [2024-11-20 00:11:01,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764101636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:01,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285615451] [2024-11-20 00:11:01,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:01,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:01,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:01,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:01,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:01,814 INFO L87 Difference]: Start difference. First operand 4070 states and 5510 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:11:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:03,908 INFO L93 Difference]: Finished difference Result 6880 states and 10039 transitions. [2024-11-20 00:11:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:11:03,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:11:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:03,925 INFO L225 Difference]: With dead ends: 6880 [2024-11-20 00:11:03,925 INFO L226 Difference]: Without dead ends: 4890 [2024-11-20 00:11:03,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:03,932 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1685 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1971 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:03,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 1400 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1971 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:11:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2024-11-20 00:11:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4070. [2024-11-20 00:11:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4070 states, 3539 states have (on average 1.3599886973721391) internal successors, (4813), 3563 states have internal predecessors, (4813), 298 states have call successors, (298), 174 states have call predecessors, (298), 231 states have return successors, (394), 336 states have call predecessors, (394), 295 states have call successors, (394) [2024-11-20 00:11:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 5505 transitions. [2024-11-20 00:11:04,567 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 5505 transitions. Word has length 190 [2024-11-20 00:11:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:04,567 INFO L471 AbstractCegarLoop]: Abstraction has 4070 states and 5505 transitions. [2024-11-20 00:11:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:11:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 5505 transitions. [2024-11-20 00:11:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:11:04,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:04,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:04,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:11:04,569 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:04,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1104654243, now seen corresponding path program 1 times [2024-11-20 00:11:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:04,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335829967] [2024-11-20 00:11:04,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:04,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:11:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:11:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:11:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:04,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335829967] [2024-11-20 00:11:04,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335829967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:04,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:04,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:04,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768692756] [2024-11-20 00:11:04,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:04,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:04,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:04,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:04,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:04,824 INFO L87 Difference]: Start difference. First operand 4070 states and 5505 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:11:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:06,953 INFO L93 Difference]: Finished difference Result 6874 states and 10013 transitions. [2024-11-20 00:11:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:11:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:11:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:06,971 INFO L225 Difference]: With dead ends: 6874 [2024-11-20 00:11:06,971 INFO L226 Difference]: Without dead ends: 4884 [2024-11-20 00:11:06,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:06,976 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 1689 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:06,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 1400 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1952 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 00:11:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2024-11-20 00:11:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4070. [2024-11-20 00:11:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4070 states, 3539 states have (on average 1.3585758688895169) internal successors, (4808), 3563 states have internal predecessors, (4808), 298 states have call successors, (298), 174 states have call predecessors, (298), 231 states have return successors, (394), 336 states have call predecessors, (394), 295 states have call successors, (394) [2024-11-20 00:11:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 5500 transitions. [2024-11-20 00:11:07,482 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 5500 transitions. Word has length 190 [2024-11-20 00:11:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:07,482 INFO L471 AbstractCegarLoop]: Abstraction has 4070 states and 5500 transitions. [2024-11-20 00:11:07,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:11:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 5500 transitions. [2024-11-20 00:11:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:11:07,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:07,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:07,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:11:07,484 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:07,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:07,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1674926049, now seen corresponding path program 1 times [2024-11-20 00:11:07,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:07,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782130463] [2024-11-20 00:11:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:07,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:11:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:11:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:11:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:07,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782130463] [2024-11-20 00:11:07,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782130463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:07,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971378617] [2024-11-20 00:11:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:07,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:07,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:07,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:07,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:07,783 INFO L87 Difference]: Start difference. First operand 4070 states and 5500 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:11:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:11:10,128 INFO L93 Difference]: Finished difference Result 6862 states and 9975 transitions. [2024-11-20 00:11:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:11:10,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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 190 [2024-11-20 00:11:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:11:10,142 INFO L225 Difference]: With dead ends: 6862 [2024-11-20 00:11:10,142 INFO L226 Difference]: Without dead ends: 4872 [2024-11-20 00:11:10,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:11:10,146 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1541 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:11:10,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 1676 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1987 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 00:11:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2024-11-20 00:11:10,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4070. [2024-11-20 00:11:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4070 states, 3539 states have (on average 1.3571630404068946) internal successors, (4803), 3563 states have internal predecessors, (4803), 298 states have call successors, (298), 174 states have call predecessors, (298), 231 states have return successors, (394), 336 states have call predecessors, (394), 295 states have call successors, (394) [2024-11-20 00:11:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 5495 transitions. [2024-11-20 00:11:10,619 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 5495 transitions. Word has length 190 [2024-11-20 00:11:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:11:10,620 INFO L471 AbstractCegarLoop]: Abstraction has 4070 states and 5495 transitions. [2024-11-20 00:11:10,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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-11-20 00:11:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 5495 transitions. [2024-11-20 00:11:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 00:11:10,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:11:10,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:11:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 00:11:10,622 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:11:10,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:11:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash 888928159, now seen corresponding path program 1 times [2024-11-20 00:11:10,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:11:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763024168] [2024-11-20 00:11:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:11:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:11:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:11:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 00:11:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 00:11:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 00:11:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-20 00:11:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:11:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:11:10,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:11:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763024168] [2024-11-20 00:11:10,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763024168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:11:10,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:11:10,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:11:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227566835] [2024-11-20 00:11:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:11:10,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:11:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:11:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:11:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:11:10,886 INFO L87 Difference]: Start difference. First operand 4070 states and 5495 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 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)