./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.05.cil-2.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.05.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 00:08:15,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 00:08:15,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 00:08:15,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 00:08:15,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 00:08:15,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 00:08:15,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 00:08:15,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 00:08:15,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 00:08:15,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 00:08:15,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 00:08:15,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 00:08:15,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 00:08:15,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 00:08:15,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 00:08:15,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 00:08:15,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 00:08:15,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 00:08:15,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 00:08:15,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 00:08:15,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 00:08:15,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 00:08:15,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 00:08:15,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 00:08:15,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 00:08:15,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 00:08:15,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 00:08:15,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 00:08:15,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 00:08:15,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 00:08:15,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 00:08:15,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 00:08:15,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:08:15,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 00:08:15,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 00:08:15,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 00:08:15,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 00:08:15,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 00:08:15,362 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 00:08:15,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 00:08:15,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 00:08:15,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 00:08:15,364 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 -> 8b411c6ac71505d2c5059a06fd3211eebca89561d9ac8be37f9ecc9ff82a7a16 [2024-11-20 00:08:15,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 00:08:15,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 00:08:15,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 00:08:15,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 00:08:15,641 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 00:08:15,642 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.05.cil-2.c [2024-11-20 00:08:17,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 00:08:17,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 00:08:17,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2024-11-20 00:08:17,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8a49113/39007a623db04370a773fb39fc3f2edd/FLAG3101561c0 [2024-11-20 00:08:17,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8a49113/39007a623db04370a773fb39fc3f2edd [2024-11-20 00:08:17,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 00:08:17,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 00:08:17,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 00:08:17,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 00:08:17,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 00:08:17,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123f4935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17, skipping insertion in model container [2024-11-20 00:08:17,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 00:08:17,555 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.05.cil-2.c[914,927] [2024-11-20 00:08:17,616 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.05.cil-2.c[7115,7128] [2024-11-20 00:08:17,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:08:17,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 00:08:17,708 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.05.cil-2.c[914,927] [2024-11-20 00:08:17,728 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.05.cil-2.c[7115,7128] [2024-11-20 00:08:17,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 00:08:17,799 INFO L204 MainTranslator]: Completed translation [2024-11-20 00:08:17,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17 WrapperNode [2024-11-20 00:08:17,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 00:08:17,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 00:08:17,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 00:08:17,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 00:08:17,808 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:08:17" (1/1) ... [2024-11-20 00:08:17,819 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:08:17" (1/1) ... [2024-11-20 00:08:17,855 INFO L138 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 31, calls inlined = 31, statements flattened = 654 [2024-11-20 00:08:17,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 00:08:17,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 00:08:17,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 00:08:17,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 00:08:17,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,901 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:08:17,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 00:08:17,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 00:08:17,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 00:08:17,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 00:08:17,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (1/1) ... [2024-11-20 00:08:17,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 00:08:17,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:08:17,983 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:08:17,987 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:08:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 00:08:18,044 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-20 00:08:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-20 00:08:18,045 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-20 00:08:18,046 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-20 00:08:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-20 00:08:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-20 00:08:18,047 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-20 00:08:18,047 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-20 00:08:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-20 00:08:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-20 00:08:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-20 00:08:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-20 00:08:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-20 00:08:18,048 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-20 00:08:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-20 00:08:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-20 00:08:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-20 00:08:18,049 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-20 00:08:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-20 00:08:18,050 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-20 00:08:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-20 00:08:18,050 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-20 00:08:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 00:08:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-20 00:08:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-20 00:08:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-20 00:08:18,051 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-20 00:08:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 00:08:18,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 00:08:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-20 00:08:18,052 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-20 00:08:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-20 00:08:18,052 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-20 00:08:18,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 00:08:18,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 00:08:18,937 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-11-20 00:08:18,937 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 00:08:18,960 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 00:08:18,961 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-20 00:08:18,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:08:18 BoogieIcfgContainer [2024-11-20 00:08:18,961 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 00:08:18,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 00:08:18,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 00:08:18,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 00:08:18,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:08:17" (1/3) ... [2024-11-20 00:08:18,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613da6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:08:18, skipping insertion in model container [2024-11-20 00:08:18,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:08:17" (2/3) ... [2024-11-20 00:08:18,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613da6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:08:18, skipping insertion in model container [2024-11-20 00:08:18,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:08:18" (3/3) ... [2024-11-20 00:08:18,970 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.05.cil-2.c [2024-11-20 00:08:18,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 00:08:18,985 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 00:08:19,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 00:08:19,067 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;@6abfb29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 00:08:19,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 00:08:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 269 states have (on average 1.5910780669144982) internal successors, (428), 277 states have internal predecessors, (428), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-20 00:08:19,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:08:19,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:19,084 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:08:19,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:19,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash 367022757, now seen corresponding path program 1 times [2024-11-20 00:08:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:19,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459683378] [2024-11-20 00:08:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:19,539 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:08:19,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:19,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459683378] [2024-11-20 00:08:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459683378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:19,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:19,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:08:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181865674] [2024-11-20 00:08:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:19,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:08:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:19,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:08:19,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:08:19,573 INFO L87 Difference]: Start difference. First operand has 322 states, 269 states have (on average 1.5910780669144982) internal successors, (428), 277 states have internal predecessors, (428), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:08:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:20,365 INFO L93 Difference]: Finished difference Result 640 states and 989 transitions. [2024-11-20 00:08:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 00:08:20,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 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:08:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:20,385 INFO L225 Difference]: With dead ends: 640 [2024-11-20 00:08:20,385 INFO L226 Difference]: Without dead ends: 329 [2024-11-20 00:08:20,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:08:20,397 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 644 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:20,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 889 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:08:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-11-20 00:08:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 311. [2024-11-20 00:08:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 261 states have (on average 1.4980842911877394) internal successors, (391), 266 states have internal predecessors, (391), 35 states have call successors, (35), 15 states have call predecessors, (35), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-20 00:08:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 457 transitions. [2024-11-20 00:08:20,485 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 457 transitions. Word has length 65 [2024-11-20 00:08:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:20,486 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 457 transitions. [2024-11-20 00:08:20,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-20 00:08:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 457 transitions. [2024-11-20 00:08:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:08:20,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:20,490 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:08:20,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 00:08:20,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:20,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1019762653, now seen corresponding path program 1 times [2024-11-20 00:08:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:20,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663836330] [2024-11-20 00:08:20,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:20,824 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:08:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:20,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663836330] [2024-11-20 00:08:20,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663836330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:20,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:20,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:08:20,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419827968] [2024-11-20 00:08:20,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:20,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:08:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:08:20,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:08:20,831 INFO L87 Difference]: Start difference. First operand 311 states and 457 transitions. 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:08:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:21,794 INFO L93 Difference]: Finished difference Result 534 states and 771 transitions. [2024-11-20 00:08:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:08:21,794 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:08:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:21,799 INFO L225 Difference]: With dead ends: 534 [2024-11-20 00:08:21,799 INFO L226 Difference]: Without dead ends: 446 [2024-11-20 00:08:21,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:08:21,801 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 796 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:21,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 1346 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:08:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-20 00:08:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 407. [2024-11-20 00:08:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 337 states have (on average 1.4688427299703264) internal successors, (495), 344 states have internal predecessors, (495), 46 states have call successors, (46), 22 states have call predecessors, (46), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-20 00:08:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 588 transitions. [2024-11-20 00:08:21,857 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 588 transitions. Word has length 65 [2024-11-20 00:08:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:21,858 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 588 transitions. [2024-11-20 00:08:21,858 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:08:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 588 transitions. [2024-11-20 00:08:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:08:21,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:21,864 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:08:21,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 00:08:21,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash 659125987, now seen corresponding path program 1 times [2024-11-20 00:08:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:21,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766695156] [2024-11-20 00:08:21,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:21,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:22,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:22,129 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:08:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766695156] [2024-11-20 00:08:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766695156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:22,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:08:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615499428] [2024-11-20 00:08:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:22,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:08:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:08:22,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:08:22,135 INFO L87 Difference]: Start difference. First operand 407 states and 588 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:08:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:23,233 INFO L93 Difference]: Finished difference Result 754 states and 1064 transitions. [2024-11-20 00:08:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:08:23,234 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:08:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:23,238 INFO L225 Difference]: With dead ends: 754 [2024-11-20 00:08:23,240 INFO L226 Difference]: Without dead ends: 577 [2024-11-20 00:08:23,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:08:23,244 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1079 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:23,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1379 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 00:08:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-11-20 00:08:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 503. [2024-11-20 00:08:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 413 states have (on average 1.4479418886198547) internal successors, (598), 422 states have internal predecessors, (598), 57 states have call successors, (57), 29 states have call predecessors, (57), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-20 00:08:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 721 transitions. [2024-11-20 00:08:23,310 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 721 transitions. Word has length 65 [2024-11-20 00:08:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:23,310 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 721 transitions. [2024-11-20 00:08:23,311 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:08:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 721 transitions. [2024-11-20 00:08:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:08:23,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:23,316 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:08:23,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 00:08:23,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:23,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1369460123, now seen corresponding path program 1 times [2024-11-20 00:08:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:23,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999618683] [2024-11-20 00:08:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:23,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:23,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:23,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:23,479 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:08:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999618683] [2024-11-20 00:08:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999618683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:08:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425163859] [2024-11-20 00:08:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:23,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:08:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:08:23,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:08:23,482 INFO L87 Difference]: Start difference. First operand 503 states and 721 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:08:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:24,361 INFO L93 Difference]: Finished difference Result 802 states and 1132 transitions. [2024-11-20 00:08:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:08:24,362 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:08:24,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:24,366 INFO L225 Difference]: With dead ends: 802 [2024-11-20 00:08:24,366 INFO L226 Difference]: Without dead ends: 535 [2024-11-20 00:08:24,367 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:08:24,368 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 549 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:24,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1656 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:08:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-20 00:08:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 508. [2024-11-20 00:08:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 417 states have (on average 1.4388489208633093) internal successors, (600), 426 states have internal predecessors, (600), 57 states have call successors, (57), 29 states have call predecessors, (57), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2024-11-20 00:08:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 724 transitions. [2024-11-20 00:08:24,408 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 724 transitions. Word has length 65 [2024-11-20 00:08:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:24,410 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 724 transitions. [2024-11-20 00:08:24,411 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:08:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 724 transitions. [2024-11-20 00:08:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:08:24,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:24,412 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:08:24,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 00:08:24,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:24,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1896147875, now seen corresponding path program 1 times [2024-11-20 00:08:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:24,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848180929] [2024-11-20 00:08:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:24,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:24,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:24,578 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:08:24,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:24,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848180929] [2024-11-20 00:08:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848180929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:24,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:08:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932544031] [2024-11-20 00:08:24,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:24,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:08:24,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:24,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:08:24,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:08:24,581 INFO L87 Difference]: Start difference. First operand 508 states and 724 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:08:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:25,478 INFO L93 Difference]: Finished difference Result 824 states and 1154 transitions. [2024-11-20 00:08:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:08:25,479 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:08:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:25,482 INFO L225 Difference]: With dead ends: 824 [2024-11-20 00:08:25,482 INFO L226 Difference]: Without dead ends: 552 [2024-11-20 00:08:25,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:08:25,485 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 555 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:25,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1655 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:08:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-20 00:08:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 523. [2024-11-20 00:08:25,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 429 states have (on average 1.4265734265734267) internal successors, (612), 438 states have internal predecessors, (612), 57 states have call successors, (57), 29 states have call predecessors, (57), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2024-11-20 00:08:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 739 transitions. [2024-11-20 00:08:25,525 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 739 transitions. Word has length 65 [2024-11-20 00:08:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:25,526 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 739 transitions. [2024-11-20 00:08:25,526 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:08:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 739 transitions. [2024-11-20 00:08:25,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:08:25,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:25,529 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:08:25,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 00:08:25,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:25,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1012616027, now seen corresponding path program 1 times [2024-11-20 00:08:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:25,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474648863] [2024-11-20 00:08:25,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:25,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:25,715 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:08:25,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:25,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474648863] [2024-11-20 00:08:25,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474648863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:25,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:25,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:08:25,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222768577] [2024-11-20 00:08:25,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:25,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:08:25,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:08:25,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:08:25,720 INFO L87 Difference]: Start difference. First operand 523 states and 739 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:08:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:26,702 INFO L93 Difference]: Finished difference Result 915 states and 1250 transitions. [2024-11-20 00:08:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 00:08:26,702 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:08:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:26,706 INFO L225 Difference]: With dead ends: 915 [2024-11-20 00:08:26,706 INFO L226 Difference]: Without dead ends: 630 [2024-11-20 00:08:26,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-20 00:08:26,709 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 1105 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:26,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 1193 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:08:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-20 00:08:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 535. [2024-11-20 00:08:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 439 states have (on average 1.4168564920273348) internal successors, (622), 448 states have internal predecessors, (622), 58 states have call successors, (58), 30 states have call predecessors, (58), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2024-11-20 00:08:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 749 transitions. [2024-11-20 00:08:26,750 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 749 transitions. Word has length 65 [2024-11-20 00:08:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:26,751 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 749 transitions. [2024-11-20 00:08:26,752 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:08:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 749 transitions. [2024-11-20 00:08:26,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-20 00:08:26,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:26,756 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:08:26,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 00:08:26,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:26,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:26,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1146629533, now seen corresponding path program 1 times [2024-11-20 00:08:26,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:26,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081655850] [2024-11-20 00:08:26,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:26,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:26,867 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:08:26,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:26,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081655850] [2024-11-20 00:08:26,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081655850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:26,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:26,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899150114] [2024-11-20 00:08:26,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:26,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:26,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:26,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:26,869 INFO L87 Difference]: Start difference. First operand 535 states and 749 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:08:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:27,537 INFO L93 Difference]: Finished difference Result 1177 states and 1593 transitions. [2024-11-20 00:08:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 00:08:27,538 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:08:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:27,543 INFO L225 Difference]: With dead ends: 1177 [2024-11-20 00:08:27,544 INFO L226 Difference]: Without dead ends: 881 [2024-11-20 00:08:27,546 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:08:27,547 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1083 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:27,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 925 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:08:27,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-20 00:08:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 825. [2024-11-20 00:08:27,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 663 states have (on average 1.3665158371040724) internal successors, (906), 679 states have internal predecessors, (906), 93 states have call successors, (93), 52 states have call predecessors, (93), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2024-11-20 00:08:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1125 transitions. [2024-11-20 00:08:27,611 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1125 transitions. Word has length 65 [2024-11-20 00:08:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:27,611 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1125 transitions. [2024-11-20 00:08:27,612 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:08:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1125 transitions. [2024-11-20 00:08:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:08:27,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:27,614 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:08:27,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 00:08:27,614 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -502764948, now seen corresponding path program 1 times [2024-11-20 00:08:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037817260] [2024-11-20 00:08:27,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:27,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:27,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:27,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:27,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:27,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:27,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:27,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:27,681 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:08:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037817260] [2024-11-20 00:08:27,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037817260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:27,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:08:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359968803] [2024-11-20 00:08:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:08:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:27,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:08:27,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:08:27,683 INFO L87 Difference]: Start difference. First operand 825 states and 1125 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:08:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:28,393 INFO L93 Difference]: Finished difference Result 2028 states and 2692 transitions. [2024-11-20 00:08:28,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:08:28,393 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:08:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:28,400 INFO L225 Difference]: With dead ends: 2028 [2024-11-20 00:08:28,401 INFO L226 Difference]: Without dead ends: 1421 [2024-11-20 00:08:28,403 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:08:28,403 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 562 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:28,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1099 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:08:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-11-20 00:08:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1306. [2024-11-20 00:08:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1042 states have (on average 1.3330134357005758) internal successors, (1389), 1061 states have internal predecessors, (1389), 138 states have call successors, (138), 96 states have call predecessors, (138), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2024-11-20 00:08:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1725 transitions. [2024-11-20 00:08:28,493 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1725 transitions. Word has length 66 [2024-11-20 00:08:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:28,494 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1725 transitions. [2024-11-20 00:08:28,494 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:08:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1725 transitions. [2024-11-20 00:08:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 00:08:28,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:28,496 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:08:28,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 00:08:28,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:28,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash 955474711, now seen corresponding path program 1 times [2024-11-20 00:08:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:28,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813953786] [2024-11-20 00:08:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:28,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:28,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:28,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:28,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:28,591 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:08:28,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:28,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813953786] [2024-11-20 00:08:28,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813953786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:28,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:28,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:08:28,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520674692] [2024-11-20 00:08:28,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:28,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:08:28,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:28,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:08:28,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:08:28,595 INFO L87 Difference]: Start difference. First operand 1306 states and 1725 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:08:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:29,313 INFO L93 Difference]: Finished difference Result 3494 states and 4531 transitions. [2024-11-20 00:08:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:08:29,314 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:08:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:29,325 INFO L225 Difference]: With dead ends: 3494 [2024-11-20 00:08:29,325 INFO L226 Difference]: Without dead ends: 2426 [2024-11-20 00:08:29,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-20 00:08:29,329 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 1087 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:29,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 727 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:08:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2024-11-20 00:08:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 2168. [2024-11-20 00:08:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1708 states have (on average 1.2974238875878221) internal successors, (2216), 1737 states have internal predecessors, (2216), 236 states have call successors, (236), 180 states have call predecessors, (236), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2024-11-20 00:08:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2786 transitions. [2024-11-20 00:08:29,498 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2786 transitions. Word has length 66 [2024-11-20 00:08:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:29,498 INFO L471 AbstractCegarLoop]: Abstraction has 2168 states and 2786 transitions. [2024-11-20 00:08:29,498 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:08:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2786 transitions. [2024-11-20 00:08:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-20 00:08:29,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:29,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:29,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 00:08:29,502 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:29,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2043324725, now seen corresponding path program 1 times [2024-11-20 00:08:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:29,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869259262] [2024-11-20 00:08:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:29,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:29,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:29,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:29,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:08:29,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:29,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869259262] [2024-11-20 00:08:29,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869259262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:29,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:29,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:08:29,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745217961] [2024-11-20 00:08:29,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:29,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:08:29,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:08:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:08:29,587 INFO L87 Difference]: Start difference. First operand 2168 states and 2786 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:08:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:30,333 INFO L93 Difference]: Finished difference Result 5078 states and 6436 transitions. [2024-11-20 00:08:30,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:08:30,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-20 00:08:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:30,349 INFO L225 Difference]: With dead ends: 5078 [2024-11-20 00:08:30,350 INFO L226 Difference]: Without dead ends: 3148 [2024-11-20 00:08:30,354 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:08:30,355 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1068 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:30,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 763 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 00:08:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2024-11-20 00:08:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 2900. [2024-11-20 00:08:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2900 states, 2276 states have (on average 1.2829525483304043) internal successors, (2920), 2313 states have internal predecessors, (2920), 316 states have call successors, (316), 250 states have call predecessors, (316), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2024-11-20 00:08:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3679 transitions. [2024-11-20 00:08:30,645 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3679 transitions. Word has length 72 [2024-11-20 00:08:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:30,646 INFO L471 AbstractCegarLoop]: Abstraction has 2900 states and 3679 transitions. [2024-11-20 00:08:30,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 00:08:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3679 transitions. [2024-11-20 00:08:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-20 00:08:30,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:30,649 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:08:30,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 00:08:30,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash 564993281, now seen corresponding path program 1 times [2024-11-20 00:08:30,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:30,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355420203] [2024-11-20 00:08:30,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:30,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:30,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:30,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:30,762 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:08:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355420203] [2024-11-20 00:08:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355420203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:30,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:30,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304772020] [2024-11-20 00:08:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:30,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:30,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:30,765 INFO L87 Difference]: Start difference. First operand 2900 states and 3679 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:08:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:31,659 INFO L93 Difference]: Finished difference Result 3674 states and 4610 transitions. [2024-11-20 00:08:31,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 00:08:31,660 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:08:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:31,676 INFO L225 Difference]: With dead ends: 3674 [2024-11-20 00:08:31,676 INFO L226 Difference]: Without dead ends: 3671 [2024-11-20 00:08:31,678 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:08:31,679 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1525 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:31,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 739 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:08:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-11-20 00:08:31,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3394. [2024-11-20 00:08:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 2661 states have (on average 1.2747087561067267) internal successors, (3392), 2703 states have internal predecessors, (3392), 366 states have call successors, (366), 294 states have call predecessors, (366), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2024-11-20 00:08:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4280 transitions. [2024-11-20 00:08:31,975 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4280 transitions. Word has length 73 [2024-11-20 00:08:31,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:31,975 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 4280 transitions. [2024-11-20 00:08:31,975 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:08:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4280 transitions. [2024-11-20 00:08:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 00:08:31,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:31,977 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:08:31,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 00:08:31,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:31,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash 333968853, now seen corresponding path program 1 times [2024-11-20 00:08:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529837890] [2024-11-20 00:08:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,152 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:08:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529837890] [2024-11-20 00:08:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529837890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 00:08:32,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103023749] [2024-11-20 00:08:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:32,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 00:08:32,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 00:08:32,158 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:08:32,159 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:08:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:32,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 00:08:32,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 00:08:32,532 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:08:32,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 00:08:32,617 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:08:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103023749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 00:08:32,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 00:08:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-20 00:08:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228799479] [2024-11-20 00:08:32,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 00:08:32,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 00:08:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 00:08:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-20 00:08:32,620 INFO L87 Difference]: Start difference. First operand 3394 states and 4280 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:08:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:34,614 INFO L93 Difference]: Finished difference Result 7835 states and 9766 transitions. [2024-11-20 00:08:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 00:08:34,615 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:08:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:34,653 INFO L225 Difference]: With dead ends: 7835 [2024-11-20 00:08:34,654 INFO L226 Difference]: Without dead ends: 7832 [2024-11-20 00:08:34,658 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:08:34,659 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 2067 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:34,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 1460 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 00:08:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7832 states. [2024-11-20 00:08:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7832 to 5184. [2024-11-20 00:08:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5184 states, 4065 states have (on average 1.2713407134071342) internal successors, (5168), 4129 states have internal predecessors, (5168), 550 states have call successors, (550), 452 states have call predecessors, (550), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2024-11-20 00:08:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5184 states to 5184 states and 6518 transitions. [2024-11-20 00:08:35,329 INFO L78 Accepts]: Start accepts. Automaton has 5184 states and 6518 transitions. Word has length 74 [2024-11-20 00:08:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:35,329 INFO L471 AbstractCegarLoop]: Abstraction has 5184 states and 6518 transitions. [2024-11-20 00:08:35,330 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:08:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5184 states and 6518 transitions. [2024-11-20 00:08:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 00:08:35,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:35,333 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:08:35,342 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:08:35,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-20 00:08:35,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:35,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash 976546945, now seen corresponding path program 2 times [2024-11-20 00:08:35,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:35,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539828894] [2024-11-20 00:08:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:35,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:35,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:35,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:35,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:35,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:35,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:35,612 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:08:35,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:35,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539828894] [2024-11-20 00:08:35,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539828894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:35,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:35,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:08:35,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37565299] [2024-11-20 00:08:35,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:35,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:08:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:08:35,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:08:35,615 INFO L87 Difference]: Start difference. First operand 5184 states and 6518 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:08:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:36,471 INFO L93 Difference]: Finished difference Result 7866 states and 9891 transitions. [2024-11-20 00:08:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 00:08:36,471 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:08:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:36,490 INFO L225 Difference]: With dead ends: 7866 [2024-11-20 00:08:36,491 INFO L226 Difference]: Without dead ends: 3791 [2024-11-20 00:08:36,500 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:08:36,501 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 775 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:36,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1064 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 00:08:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2024-11-20 00:08:36,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3556. [2024-11-20 00:08:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3556 states, 2793 states have (on average 1.2559971356963837) internal successors, (3508), 2835 states have internal predecessors, (3508), 382 states have call successors, (382), 308 states have call predecessors, (382), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2024-11-20 00:08:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 3556 states and 4416 transitions. [2024-11-20 00:08:36,874 INFO L78 Accepts]: Start accepts. Automaton has 3556 states and 4416 transitions. Word has length 77 [2024-11-20 00:08:36,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:36,875 INFO L471 AbstractCegarLoop]: Abstraction has 3556 states and 4416 transitions. [2024-11-20 00:08:36,875 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:08:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3556 states and 4416 transitions. [2024-11-20 00:08:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 00:08:36,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:36,880 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:08:36,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 00:08:36,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:36,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1383113145, now seen corresponding path program 1 times [2024-11-20 00:08:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:36,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853193743] [2024-11-20 00:08:36,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:36,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 00:08:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:36,998 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:08:36,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:36,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853193743] [2024-11-20 00:08:36,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853193743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:36,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:36,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 00:08:36,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341027667] [2024-11-20 00:08:36,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:37,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 00:08:37,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 00:08:37,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 00:08:37,001 INFO L87 Difference]: Start difference. First operand 3556 states and 4416 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:08:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:38,456 INFO L93 Difference]: Finished difference Result 10412 states and 12797 transitions. [2024-11-20 00:08:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 00:08:38,456 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:08:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:38,486 INFO L225 Difference]: With dead ends: 10412 [2024-11-20 00:08:38,486 INFO L226 Difference]: Without dead ends: 5791 [2024-11-20 00:08:38,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-20 00:08:38,500 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 788 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:38,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1451 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 00:08:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2024-11-20 00:08:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 5471. [2024-11-20 00:08:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5471 states, 4251 states have (on average 1.2314749470712774) internal successors, (5235), 4336 states have internal predecessors, (5235), 586 states have call successors, (586), 482 states have call predecessors, (586), 632 states have return successors, (908), 659 states have call predecessors, (908), 583 states have call successors, (908) [2024-11-20 00:08:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 6729 transitions. [2024-11-20 00:08:39,063 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 6729 transitions. Word has length 84 [2024-11-20 00:08:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:39,064 INFO L471 AbstractCegarLoop]: Abstraction has 5471 states and 6729 transitions. [2024-11-20 00:08:39,064 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:08:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 6729 transitions. [2024-11-20 00:08:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-20 00:08:39,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:39,068 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:08:39,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 00:08:39,069 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:39,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1185637441, now seen corresponding path program 1 times [2024-11-20 00:08:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:39,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526145801] [2024-11-20 00:08:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-20 00:08:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 00:08:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-20 00:08:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 00:08:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 00:08:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 00:08:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 00:08:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:39,182 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:08:39,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:39,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526145801] [2024-11-20 00:08:39,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526145801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:39,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 00:08:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525592121] [2024-11-20 00:08:39,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:39,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 00:08:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:39,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 00:08:39,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:08:39,185 INFO L87 Difference]: Start difference. First operand 5471 states and 6729 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:08:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:40,668 INFO L93 Difference]: Finished difference Result 9474 states and 11569 transitions. [2024-11-20 00:08:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 00:08:40,669 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:08:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:40,689 INFO L225 Difference]: With dead ends: 9474 [2024-11-20 00:08:40,690 INFO L226 Difference]: Without dead ends: 4881 [2024-11-20 00:08:40,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-20 00:08:40,702 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 1748 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1787 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:40,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1787 Valid, 1267 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 00:08:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2024-11-20 00:08:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4547. [2024-11-20 00:08:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4547 states, 3540 states have (on average 1.2242937853107345) internal successors, (4334), 3607 states have internal predecessors, (4334), 487 states have call successors, (487), 397 states have call predecessors, (487), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-11-20 00:08:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 5507 transitions. [2024-11-20 00:08:41,099 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 5507 transitions. Word has length 93 [2024-11-20 00:08:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:41,099 INFO L471 AbstractCegarLoop]: Abstraction has 4547 states and 5507 transitions. [2024-11-20 00:08:41,100 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:08:41,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 5507 transitions. [2024-11-20 00:08:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:08:41,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:41,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:41,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 00:08:41,105 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:41,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2129567276, now seen corresponding path program 1 times [2024-11-20 00:08:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:41,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984467677] [2024-11-20 00:08:41,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:41,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:41,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:08:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:08:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:08:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:08:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:41,191 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:08:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984467677] [2024-11-20 00:08:41,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984467677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:41,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:41,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 00:08:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109726537] [2024-11-20 00:08:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:41,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 00:08:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 00:08:41,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 00:08:41,193 INFO L87 Difference]: Start difference. First operand 4547 states and 5507 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:42,573 INFO L93 Difference]: Finished difference Result 4817 states and 5929 transitions. [2024-11-20 00:08:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 00:08:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:08:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:42,595 INFO L225 Difference]: With dead ends: 4817 [2024-11-20 00:08:42,595 INFO L226 Difference]: Without dead ends: 4612 [2024-11-20 00:08:42,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 00:08:42,599 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 631 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:42,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 687 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 00:08:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4612 states. [2024-11-20 00:08:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4612 to 4547. [2024-11-20 00:08:43,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4547 states, 3540 states have (on average 1.2240112994350283) internal successors, (4333), 3607 states have internal predecessors, (4333), 487 states have call successors, (487), 397 states have call predecessors, (487), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-11-20 00:08:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 5506 transitions. [2024-11-20 00:08:43,406 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 5506 transitions. Word has length 102 [2024-11-20 00:08:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:43,406 INFO L471 AbstractCegarLoop]: Abstraction has 4547 states and 5506 transitions. [2024-11-20 00:08:43,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 5506 transitions. [2024-11-20 00:08:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:08:43,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:43,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:43,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 00:08:43,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:43,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash 288336790, now seen corresponding path program 1 times [2024-11-20 00:08:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650660333] [2024-11-20 00:08:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:43,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:08:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:43,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:08:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:08:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:43,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:08:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:43,526 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:08:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:43,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650660333] [2024-11-20 00:08:43,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650660333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:43,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:43,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 00:08:43,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366715993] [2024-11-20 00:08:43,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:43,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 00:08:43,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:43,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 00:08:43,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 00:08:43,529 INFO L87 Difference]: Start difference. First operand 4547 states and 5506 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:45,464 INFO L93 Difference]: Finished difference Result 5085 states and 6349 transitions. [2024-11-20 00:08:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 00:08:45,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:08:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:45,486 INFO L225 Difference]: With dead ends: 5085 [2024-11-20 00:08:45,486 INFO L226 Difference]: Without dead ends: 4883 [2024-11-20 00:08:45,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 00:08:45,489 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1000 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:45,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 978 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:08:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2024-11-20 00:08:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4752. [2024-11-20 00:08:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 3724 states have (on average 1.2400644468313642) internal successors, (4618), 3792 states have internal predecessors, (4618), 501 states have call successors, (501), 403 states have call predecessors, (501), 525 states have return successors, (703), 563 states have call predecessors, (703), 498 states have call successors, (703) [2024-11-20 00:08:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 5822 transitions. [2024-11-20 00:08:46,175 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 5822 transitions. Word has length 102 [2024-11-20 00:08:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:46,175 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 5822 transitions. [2024-11-20 00:08:46,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 5822 transitions. [2024-11-20 00:08:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:08:46,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:46,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:46,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 00:08:46,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:46,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1670237996, now seen corresponding path program 1 times [2024-11-20 00:08:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139681161] [2024-11-20 00:08:46,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:46,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:08:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:46,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:08:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:46,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:08:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:46,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:08:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:46,323 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:08:46,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:46,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139681161] [2024-11-20 00:08:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139681161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:46,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:46,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069507981] [2024-11-20 00:08:46,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:46,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:46,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:46,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:46,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:46,326 INFO L87 Difference]: Start difference. First operand 4752 states and 5822 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:48,658 INFO L93 Difference]: Finished difference Result 5567 states and 7098 transitions. [2024-11-20 00:08:48,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:08:48,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:08:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:48,679 INFO L225 Difference]: With dead ends: 5567 [2024-11-20 00:08:48,679 INFO L226 Difference]: Without dead ends: 5160 [2024-11-20 00:08:48,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:08:48,683 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1011 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:48,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1722 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:08:48,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5160 states. [2024-11-20 00:08:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5160 to 4945. [2024-11-20 00:08:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4945 states, 3896 states have (on average 1.2523100616016427) internal successors, (4879), 3965 states have internal predecessors, (4879), 515 states have call successors, (515), 409 states have call predecessors, (515), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2024-11-20 00:08:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6113 transitions. [2024-11-20 00:08:49,342 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6113 transitions. Word has length 102 [2024-11-20 00:08:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:49,342 INFO L471 AbstractCegarLoop]: Abstraction has 4945 states and 6113 transitions. [2024-11-20 00:08:49,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6113 transitions. [2024-11-20 00:08:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:08:49,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:49,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:49,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 00:08:49,347 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:49,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:49,347 INFO L85 PathProgramCache]: Analyzing trace with hash 745598354, now seen corresponding path program 1 times [2024-11-20 00:08:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532193608] [2024-11-20 00:08:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:08:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:08:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:49,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:08:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:49,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:08:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:08:49,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:49,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532193608] [2024-11-20 00:08:49,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532193608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:49,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:49,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:49,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138623801] [2024-11-20 00:08:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:49,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:49,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:49,522 INFO L87 Difference]: Start difference. First operand 4945 states and 6113 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:51,562 INFO L93 Difference]: Finished difference Result 6275 states and 8189 transitions. [2024-11-20 00:08:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:08:51,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:08:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:51,581 INFO L225 Difference]: With dead ends: 6275 [2024-11-20 00:08:51,581 INFO L226 Difference]: Without dead ends: 5675 [2024-11-20 00:08:51,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:08:51,586 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1006 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:51,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 1720 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:08:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5675 states. [2024-11-20 00:08:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5675 to 5334. [2024-11-20 00:08:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5334 states, 4243 states have (on average 1.2740985152015083) internal successors, (5406), 4314 states have internal predecessors, (5406), 543 states have call successors, (543), 421 states have call predecessors, (543), 546 states have return successors, (755), 608 states have call predecessors, (755), 540 states have call successors, (755) [2024-11-20 00:08:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5334 states to 5334 states and 6704 transitions. [2024-11-20 00:08:52,281 INFO L78 Accepts]: Start accepts. Automaton has 5334 states and 6704 transitions. Word has length 102 [2024-11-20 00:08:52,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:52,281 INFO L471 AbstractCegarLoop]: Abstraction has 5334 states and 6704 transitions. [2024-11-20 00:08:52,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 6704 transitions. [2024-11-20 00:08:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:08:52,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:52,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:52,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 00:08:52,287 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:52,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2070454548, now seen corresponding path program 1 times [2024-11-20 00:08:52,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:52,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113140974] [2024-11-20 00:08:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:08:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:08:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:08:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:52,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:08:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:52,426 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:08:52,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113140974] [2024-11-20 00:08:52,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113140974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:52,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:52,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531249447] [2024-11-20 00:08:52,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:52,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:52,429 INFO L87 Difference]: Start difference. First operand 5334 states and 6704 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:54,460 INFO L93 Difference]: Finished difference Result 7650 states and 10304 transitions. [2024-11-20 00:08:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:08:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:08:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:54,484 INFO L225 Difference]: With dead ends: 7650 [2024-11-20 00:08:54,484 INFO L226 Difference]: Without dead ends: 6661 [2024-11-20 00:08:54,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:08:54,492 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1005 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:54,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1720 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 00:08:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2024-11-20 00:08:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 6115. [2024-11-20 00:08:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6115 states, 4940 states have (on average 1.308502024291498) internal successors, (6464), 5015 states have internal predecessors, (6464), 599 states have call successors, (599), 445 states have call predecessors, (599), 574 states have return successors, (833), 668 states have call predecessors, (833), 596 states have call successors, (833) [2024-11-20 00:08:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 7896 transitions. [2024-11-20 00:08:55,600 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 7896 transitions. Word has length 102 [2024-11-20 00:08:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:55,600 INFO L471 AbstractCegarLoop]: Abstraction has 6115 states and 7896 transitions. [2024-11-20 00:08:55,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 7896 transitions. [2024-11-20 00:08:55,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:08:55,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:55,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:55,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 00:08:55,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:55,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash -657754798, now seen corresponding path program 1 times [2024-11-20 00:08:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:55,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7602570] [2024-11-20 00:08:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:55,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:08:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:08:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:55,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:08:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:08:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:55,747 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:08:55,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:55,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7602570] [2024-11-20 00:08:55,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7602570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:55,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:55,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439149047] [2024-11-20 00:08:55,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:55,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:55,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:55,751 INFO L87 Difference]: Start difference. First operand 6115 states and 7896 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:08:57,969 INFO L93 Difference]: Finished difference Result 10401 states and 14554 transitions. [2024-11-20 00:08:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 00:08:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:08:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:08:57,996 INFO L225 Difference]: With dead ends: 10401 [2024-11-20 00:08:57,996 INFO L226 Difference]: Without dead ends: 8631 [2024-11-20 00:08:58,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-20 00:08:58,005 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1004 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:08:58,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1720 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:08:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8631 states. [2024-11-20 00:08:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8631 to 7684. [2024-11-20 00:08:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7684 states, 6341 states have (on average 1.3546759186248225) internal successors, (8590), 6424 states have internal predecessors, (8590), 711 states have call successors, (711), 493 states have call predecessors, (711), 630 states have return successors, (1007), 788 states have call predecessors, (1007), 708 states have call successors, (1007) [2024-11-20 00:08:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 10308 transitions. [2024-11-20 00:08:58,932 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 10308 transitions. Word has length 102 [2024-11-20 00:08:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:08:58,932 INFO L471 AbstractCegarLoop]: Abstraction has 7684 states and 10308 transitions. [2024-11-20 00:08:58,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:08:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 10308 transitions. [2024-11-20 00:08:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:08:58,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:08:58,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:08:58,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 00:08:58,939 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:08:58,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:08:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1715592876, now seen corresponding path program 1 times [2024-11-20 00:08:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:08:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500463866] [2024-11-20 00:08:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:08:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:08:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:58,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:08:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:59,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:08:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:59,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:08:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:08:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:08:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:08:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:08:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:08:59,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500463866] [2024-11-20 00:08:59,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500463866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:08:59,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:08:59,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:08:59,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370572527] [2024-11-20 00:08:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:08:59,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:08:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:08:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:08:59,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:08:59,081 INFO L87 Difference]: Start difference. First operand 7684 states and 10308 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:01,651 INFO L93 Difference]: Finished difference Result 17168 states and 25006 transitions. [2024-11-20 00:09:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:09:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:09:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:01,691 INFO L225 Difference]: With dead ends: 17168 [2024-11-20 00:09:01,692 INFO L226 Difference]: Without dead ends: 13829 [2024-11-20 00:09:01,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:09:01,707 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1056 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 2361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:01,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1710 Invalid, 2361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:09:01,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13829 states. [2024-11-20 00:09:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13829 to 10789. [2024-11-20 00:09:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10789 states, 9126 states have (on average 1.40609248301556) internal successors, (12832), 9225 states have internal predecessors, (12832), 919 states have call successors, (919), 589 states have call predecessors, (919), 742 states have return successors, (1393), 1012 states have call predecessors, (1393), 916 states have call successors, (1393) [2024-11-20 00:09:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 15144 transitions. [2024-11-20 00:09:03,021 INFO L78 Accepts]: Start accepts. Automaton has 10789 states and 15144 transitions. Word has length 102 [2024-11-20 00:09:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:03,022 INFO L471 AbstractCegarLoop]: Abstraction has 10789 states and 15144 transitions. [2024-11-20 00:09:03,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 10789 states and 15144 transitions. [2024-11-20 00:09:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:09:03,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:03,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:03,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 00:09:03,033 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:03,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1436871954, now seen corresponding path program 1 times [2024-11-20 00:09:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113460780] [2024-11-20 00:09:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:09:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:09:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:09:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:09:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:03,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:03,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113460780] [2024-11-20 00:09:03,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113460780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:03,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:03,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470085918] [2024-11-20 00:09:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:03,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:03,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:03,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:03,199 INFO L87 Difference]: Start difference. First operand 10789 states and 15144 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:06,174 INFO L93 Difference]: Finished difference Result 28911 states and 43412 transitions. [2024-11-20 00:09:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:09:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:09:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:06,244 INFO L225 Difference]: With dead ends: 28911 [2024-11-20 00:09:06,244 INFO L226 Difference]: Without dead ends: 22467 [2024-11-20 00:09:06,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:09:06,281 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 1175 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:06,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 1706 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:09:06,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22467 states. [2024-11-20 00:09:08,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22467 to 16662. [2024-11-20 00:09:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16662 states, 14375 states have (on average 1.4437565217391304) internal successors, (20754), 14506 states have internal predecessors, (20754), 1319 states have call successors, (1319), 781 states have call predecessors, (1319), 966 states have return successors, (2311), 1444 states have call predecessors, (2311), 1316 states have call successors, (2311) [2024-11-20 00:09:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16662 states to 16662 states and 24384 transitions. [2024-11-20 00:09:08,089 INFO L78 Accepts]: Start accepts. Automaton has 16662 states and 24384 transitions. Word has length 102 [2024-11-20 00:09:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:08,089 INFO L471 AbstractCegarLoop]: Abstraction has 16662 states and 24384 transitions. [2024-11-20 00:09:08,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 16662 states and 24384 transitions. [2024-11-20 00:09:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:09:08,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:08,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:08,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 00:09:08,103 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:08,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1677111700, now seen corresponding path program 1 times [2024-11-20 00:09:08,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937469427] [2024-11-20 00:09:08,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:09:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:09:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:09:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:09:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:08,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937469427] [2024-11-20 00:09:08,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937469427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:08,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:08,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:08,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525936812] [2024-11-20 00:09:08,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:08,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:08,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:08,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:08,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:08,250 INFO L87 Difference]: Start difference. First operand 16662 states and 24384 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:12,297 INFO L93 Difference]: Finished difference Result 50846 states and 78170 transitions. [2024-11-20 00:09:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:09:12,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:09:12,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:12,431 INFO L225 Difference]: With dead ends: 50846 [2024-11-20 00:09:12,431 INFO L226 Difference]: Without dead ends: 38529 [2024-11-20 00:09:12,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:09:12,483 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1081 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1896 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:12,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1184 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1896 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 00:09:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38529 states. [2024-11-20 00:09:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38529 to 28695. [2024-11-20 00:09:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28695 states, 25192 states have (on average 1.4768180374722133) internal successors, (37204), 25387 states have internal predecessors, (37204), 2087 states have call successors, (2087), 1165 states have call predecessors, (2087), 1414 states have return successors, (4601), 2276 states have call predecessors, (4601), 2084 states have call successors, (4601) [2024-11-20 00:09:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28695 states to 28695 states and 43892 transitions. [2024-11-20 00:09:15,043 INFO L78 Accepts]: Start accepts. Automaton has 28695 states and 43892 transitions. Word has length 102 [2024-11-20 00:09:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:15,043 INFO L471 AbstractCegarLoop]: Abstraction has 28695 states and 43892 transitions. [2024-11-20 00:09:15,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 28695 states and 43892 transitions. [2024-11-20 00:09:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:09:15,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:15,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:15,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 00:09:15,060 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:15,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1778821934, now seen corresponding path program 1 times [2024-11-20 00:09:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766171085] [2024-11-20 00:09:15,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:15,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:09:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:09:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:09:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:09:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766171085] [2024-11-20 00:09:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766171085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:15,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:15,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677142246] [2024-11-20 00:09:15,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:15,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:15,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:15,201 INFO L87 Difference]: Start difference. First operand 28695 states and 43892 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 00:09:21,528 INFO L93 Difference]: Finished difference Result 92507 states and 146588 transitions. [2024-11-20 00:09:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 00:09:21,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2024-11-20 00:09:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 00:09:21,818 INFO L225 Difference]: With dead ends: 92507 [2024-11-20 00:09:21,818 INFO L226 Difference]: Without dead ends: 68157 [2024-11-20 00:09:21,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 00:09:21,893 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1059 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 00:09:21,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1710 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 00:09:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68157 states. [2024-11-20 00:09:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68157 to 52825. [2024-11-20 00:09:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52825 states, 46954 states have (on average 1.499850917919666) internal successors, (70424), 47277 states have internal predecessors, (70424), 3559 states have call successors, (3559), 1933 states have call predecessors, (3559), 2310 states have return successors, (10575), 3876 states have call predecessors, (10575), 3556 states have call successors, (10575) [2024-11-20 00:09:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52825 states to 52825 states and 84558 transitions. [2024-11-20 00:09:27,221 INFO L78 Accepts]: Start accepts. Automaton has 52825 states and 84558 transitions. Word has length 102 [2024-11-20 00:09:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 00:09:27,221 INFO L471 AbstractCegarLoop]: Abstraction has 52825 states and 84558 transitions. [2024-11-20 00:09:27,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-20 00:09:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 52825 states and 84558 transitions. [2024-11-20 00:09:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-20 00:09:27,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 00:09:27,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 00:09:27,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 00:09:27,256 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 00:09:27,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 00:09:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 438808464, now seen corresponding path program 1 times [2024-11-20 00:09:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 00:09:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753382683] [2024-11-20 00:09:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 00:09:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 00:09:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-20 00:09:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 00:09:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-20 00:09:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-20 00:09:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 00:09:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 00:09:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 00:09:27,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 00:09:27,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753382683] [2024-11-20 00:09:27,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753382683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 00:09:27,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 00:09:27,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 00:09:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870658232] [2024-11-20 00:09:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 00:09:27,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 00:09:27,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 00:09:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 00:09:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 00:09:27,436 INFO L87 Difference]: Start difference. First operand 52825 states and 84558 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)