./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_1.cil-2+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_1.cil-2+token_ring.12.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 67128d109acca52d0fda3c2f0434d60ee9cc5cc865496b6446183c0a601e748c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:00:45,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:00:45,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 03:00:45,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:00:45,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:00:45,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:00:45,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:00:45,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:00:45,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:00:45,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:00:45,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:00:45,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:00:45,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:00:45,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:00:45,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:00:45,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:00:45,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:00:45,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 03:00:45,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 03:00:45,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 03:00:45,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:00:45,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:00:45,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:00:45,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:00:45,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:00:45,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 03:00:45,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:00:45,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:00:45,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:00:45,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:00:45,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:00:45,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:00:45,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:00:45,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:00:45,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:00:45,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:00:45,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 03:00:45,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 03:00:45,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:00:45,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:00:45,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:00:45,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:00:45,881 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 -> 67128d109acca52d0fda3c2f0434d60ee9cc5cc865496b6446183c0a601e748c [2024-10-24 03:00:46,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:00:46,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:00:46,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:00:46,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:00:46,150 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:00:46,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2024-10-24 03:00:47,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:00:47,932 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:00:47,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2024-10-24 03:00:47,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ec0ae17/8917f826fa0149bdbca93b29e7a106d9/FLAGe395c770c [2024-10-24 03:00:48,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6ec0ae17/8917f826fa0149bdbca93b29e7a106d9 [2024-10-24 03:00:48,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:00:48,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:00:48,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:00:48,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:00:48,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:00:48,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16455c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48, skipping insertion in model container [2024-10-24 03:00:48,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:00:48,510 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c[913,926] [2024-10-24 03:00:48,563 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c[5977,5990] [2024-10-24 03:00:48,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:00:48,685 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:00:48,698 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c[913,926] [2024-10-24 03:00:48,711 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.12.cil-1.c[5977,5990] [2024-10-24 03:00:48,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:00:48,855 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:00:48,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48 WrapperNode [2024-10-24 03:00:48,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:00:48,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:00:48,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:00:48,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:00:48,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,923 INFO L138 Inliner]: procedures = 72, calls = 85, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1089 [2024-10-24 03:00:48,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:00:48,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:00:48,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:00:48,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:00:48,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 03:00:48,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:48,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:49,016 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:49,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:49,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:49,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:00:49,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:00:49,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:00:49,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:00:49,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (1/1) ... [2024-10-24 03:00:49,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:00:49,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:00:49,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 03:00:49,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 03:00:49,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:00:49,137 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 03:00:49,137 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 03:00:49,138 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-24 03:00:49,139 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-24 03:00:49,139 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-24 03:00:49,140 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-24 03:00:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-24 03:00:49,140 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-24 03:00:49,140 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-24 03:00:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-24 03:00:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-24 03:00:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-24 03:00:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-24 03:00:49,141 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-24 03:00:49,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 03:00:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-24 03:00:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-24 03:00:49,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:00:49,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:00:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-24 03:00:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-24 03:00:49,143 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-24 03:00:49,143 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-24 03:00:49,297 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:00:49,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:00:50,374 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-24 03:00:50,375 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:00:50,457 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:00:50,458 INFO L314 CfgBuilder]: Removed 19 assume(true) statements. [2024-10-24 03:00:50,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:50 BoogieIcfgContainer [2024-10-24 03:00:50,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:00:50,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:00:50,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:00:50,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:00:50,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:00:48" (1/3) ... [2024-10-24 03:00:50,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1268d4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:50, skipping insertion in model container [2024-10-24 03:00:50,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:00:48" (2/3) ... [2024-10-24 03:00:50,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1268d4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:00:50, skipping insertion in model container [2024-10-24 03:00:50,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:00:50" (3/3) ... [2024-10-24 03:00:50,468 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.12.cil-1.c [2024-10-24 03:00:50,487 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:00:50,488 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 03:00:50,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:00:50,597 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;@4d7436e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:00:50,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 03:00:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 419 states, 372 states have (on average 1.728494623655914) internal successors, (643), 379 states have internal predecessors, (643), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 03:00:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-24 03:00:50,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:50,617 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] [2024-10-24 03:00:50,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1310357049, now seen corresponding path program 1 times [2024-10-24 03:00:50,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:50,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225405301] [2024-10-24 03:00:50,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:50,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:50,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:00:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:50,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225405301] [2024-10-24 03:00:50,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225405301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:00:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750190163] [2024-10-24 03:00:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:50,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:00:50,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:51,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:00:51,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:00:51,018 INFO L87 Difference]: Start difference. First operand has 419 states, 372 states have (on average 1.728494623655914) internal successors, (643), 379 states have internal predecessors, (643), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 03:00:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:51,805 INFO L93 Difference]: Finished difference Result 878 states and 1486 transitions. [2024-10-24 03:00:51,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 03:00:51,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-24 03:00:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:51,827 INFO L225 Difference]: With dead ends: 878 [2024-10-24 03:00:51,828 INFO L226 Difference]: Without dead ends: 476 [2024-10-24 03:00:51,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:51,843 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 899 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:51,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 718 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 03:00:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-24 03:00:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2024-10-24 03:00:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 419 states have (on average 1.594272076372315) internal successors, (668), 424 states have internal predecessors, (668), 38 states have call successors, (38), 12 states have call predecessors, (38), 11 states have return successors, (40), 34 states have call predecessors, (40), 34 states have call successors, (40) [2024-10-24 03:00:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 746 transitions. [2024-10-24 03:00:51,946 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 746 transitions. Word has length 37 [2024-10-24 03:00:51,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:51,947 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 746 transitions. [2024-10-24 03:00:51,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 03:00:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 746 transitions. [2024-10-24 03:00:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 03:00:51,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:51,952 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] [2024-10-24 03:00:51,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 03:00:51,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:51,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash 953818000, now seen corresponding path program 1 times [2024-10-24 03:00:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:51,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281338534] [2024-10-24 03:00:51,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 03:00:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:52,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281338534] [2024-10-24 03:00:52,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281338534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:52,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:52,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:00:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381640982] [2024-10-24 03:00:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:52,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:00:52,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:52,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:00:52,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:00:52,070 INFO L87 Difference]: Start difference. First operand 470 states and 746 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 03:00:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:52,653 INFO L93 Difference]: Finished difference Result 704 states and 1090 transitions. [2024-10-24 03:00:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 03:00:52,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-24 03:00:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:52,663 INFO L225 Difference]: With dead ends: 704 [2024-10-24 03:00:52,664 INFO L226 Difference]: Without dead ends: 593 [2024-10-24 03:00:52,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:52,666 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 912 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:52,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 717 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:00:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-10-24 03:00:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 570. [2024-10-24 03:00:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 506 states have (on average 1.5533596837944663) internal successors, (786), 512 states have internal predecessors, (786), 46 states have call successors, (46), 16 states have call predecessors, (46), 16 states have return successors, (54), 42 states have call predecessors, (54), 42 states have call successors, (54) [2024-10-24 03:00:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 886 transitions. [2024-10-24 03:00:52,735 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 886 transitions. Word has length 38 [2024-10-24 03:00:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:52,736 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 886 transitions. [2024-10-24 03:00:52,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 03:00:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 886 transitions. [2024-10-24 03:00:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-24 03:00:52,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:52,739 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] [2024-10-24 03:00:52,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 03:00:52,739 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:52,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:52,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1819321221, now seen corresponding path program 1 times [2024-10-24 03:00:52,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:52,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793437167] [2024-10-24 03:00:52,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:52,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-24 03:00:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:52,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:52,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793437167] [2024-10-24 03:00:52,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793437167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:52,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:52,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:00:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693747981] [2024-10-24 03:00:52,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:52,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:00:52,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:52,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:00:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:00:52,837 INFO L87 Difference]: Start difference. First operand 570 states and 886 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 03:00:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:53,510 INFO L93 Difference]: Finished difference Result 990 states and 1467 transitions. [2024-10-24 03:00:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 03:00:53,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-24 03:00:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:53,516 INFO L225 Difference]: With dead ends: 990 [2024-10-24 03:00:53,516 INFO L226 Difference]: Without dead ends: 779 [2024-10-24 03:00:53,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:53,518 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 347 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:53,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1018 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:00:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2024-10-24 03:00:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 675. [2024-10-24 03:00:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 599 states have (on average 1.5275459098497495) internal successors, (915), 607 states have internal predecessors, (915), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (60), 46 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-24 03:00:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1027 transitions. [2024-10-24 03:00:53,565 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1027 transitions. Word has length 39 [2024-10-24 03:00:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:53,565 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1027 transitions. [2024-10-24 03:00:53,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 03:00:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1027 transitions. [2024-10-24 03:00:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 03:00:53,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:53,570 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:53,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 03:00:53,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:53,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash -24942822, now seen corresponding path program 1 times [2024-10-24 03:00:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468735631] [2024-10-24 03:00:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 03:00:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:53,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 03:00:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 03:00:53,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:53,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468735631] [2024-10-24 03:00:53,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468735631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:53,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:53,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:00:53,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42717745] [2024-10-24 03:00:53,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:53,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:00:53,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:53,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:00:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:00:53,727 INFO L87 Difference]: Start difference. First operand 675 states and 1027 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 03:00:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:54,382 INFO L93 Difference]: Finished difference Result 1191 states and 1744 transitions. [2024-10-24 03:00:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 03:00:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-24 03:00:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:54,388 INFO L225 Difference]: With dead ends: 1191 [2024-10-24 03:00:54,389 INFO L226 Difference]: Without dead ends: 875 [2024-10-24 03:00:54,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:54,394 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 332 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:54,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1062 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 03:00:54,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-24 03:00:54,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 841. [2024-10-24 03:00:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 741 states have (on average 1.4723346828609987) internal successors, (1091), 751 states have internal predecessors, (1091), 66 states have call successors, (66), 30 states have call predecessors, (66), 32 states have return successors, (84), 60 states have call predecessors, (84), 62 states have call successors, (84) [2024-10-24 03:00:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1241 transitions. [2024-10-24 03:00:54,448 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1241 transitions. Word has length 54 [2024-10-24 03:00:54,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:54,449 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1241 transitions. [2024-10-24 03:00:54,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 03:00:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1241 transitions. [2024-10-24 03:00:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 03:00:54,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:54,455 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 03:00:54,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 03:00:54,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:54,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash 273605395, now seen corresponding path program 1 times [2024-10-24 03:00:54,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:54,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583817269] [2024-10-24 03:00:54,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 03:00:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 03:00:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 03:00:54,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:54,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583817269] [2024-10-24 03:00:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583817269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:54,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:54,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:00:54,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855585119] [2024-10-24 03:00:54,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:54,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:00:54,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:54,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:00:54,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:00:54,543 INFO L87 Difference]: Start difference. First operand 841 states and 1241 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 03:00:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:55,125 INFO L93 Difference]: Finished difference Result 1420 states and 2020 transitions. [2024-10-24 03:00:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 03:00:55,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-24 03:00:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:55,132 INFO L225 Difference]: With dead ends: 1420 [2024-10-24 03:00:55,132 INFO L226 Difference]: Without dead ends: 1018 [2024-10-24 03:00:55,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:55,134 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 898 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:55,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 729 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:00:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-10-24 03:00:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 969. [2024-10-24 03:00:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 853 states have (on average 1.4372801875732708) internal successors, (1226), 865 states have internal predecessors, (1226), 74 states have call successors, (74), 36 states have call predecessors, (74), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-10-24 03:00:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1398 transitions. [2024-10-24 03:00:55,190 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1398 transitions. Word has length 59 [2024-10-24 03:00:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:55,190 INFO L471 AbstractCegarLoop]: Abstraction has 969 states and 1398 transitions. [2024-10-24 03:00:55,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 03:00:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1398 transitions. [2024-10-24 03:00:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 03:00:55,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:55,193 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 03:00:55,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 03:00:55,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:55,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1754342566, now seen corresponding path program 1 times [2024-10-24 03:00:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:55,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567484168] [2024-10-24 03:00:55,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:55,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:00:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 03:00:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 03:00:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567484168] [2024-10-24 03:00:55,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567484168] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:00:55,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200539710] [2024-10-24 03:00:55,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:55,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:00:55,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:00:55,282 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:00:55,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 03:00:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 03:00:55,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:00:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 03:00:55,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:00:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200539710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:55,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:00:55,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 03:00:55,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792671929] [2024-10-24 03:00:55,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:55,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:00:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:55,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:00:55,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:55,448 INFO L87 Difference]: Start difference. First operand 969 states and 1398 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 03:00:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:55,594 INFO L93 Difference]: Finished difference Result 1457 states and 2072 transitions. [2024-10-24 03:00:55,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:00:55,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-24 03:00:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:55,600 INFO L225 Difference]: With dead ends: 1457 [2024-10-24 03:00:55,600 INFO L226 Difference]: Without dead ends: 974 [2024-10-24 03:00:55,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:55,603 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 0 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:55,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1825 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:00:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2024-10-24 03:00:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2024-10-24 03:00:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 858 states have (on average 1.4254079254079255) internal successors, (1223), 870 states have internal predecessors, (1223), 74 states have call successors, (74), 36 states have call predecessors, (74), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-10-24 03:00:55,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1395 transitions. [2024-10-24 03:00:55,646 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1395 transitions. Word has length 60 [2024-10-24 03:00:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:55,646 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1395 transitions. [2024-10-24 03:00:55,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 03:00:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1395 transitions. [2024-10-24 03:00:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 03:00:55,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:55,649 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 03:00:55,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 03:00:55,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 03:00:55,850 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:55,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1696619228, now seen corresponding path program 1 times [2024-10-24 03:00:55,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:55,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560199337] [2024-10-24 03:00:55,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:55,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:00:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 03:00:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 03:00:55,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:55,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560199337] [2024-10-24 03:00:55,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560199337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:00:55,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985056420] [2024-10-24 03:00:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:55,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:00:55,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:00:55,960 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:00:55,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 03:00:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:56,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 03:00:56,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:00:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 03:00:56,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:00:56,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985056420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:56,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:00:56,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-24 03:00:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634960826] [2024-10-24 03:00:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:56,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:00:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:56,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:00:56,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:56,097 INFO L87 Difference]: Start difference. First operand 974 states and 1395 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 03:00:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:56,238 INFO L93 Difference]: Finished difference Result 1400 states and 1974 transitions. [2024-10-24 03:00:56,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:00:56,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-24 03:00:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:56,244 INFO L225 Difference]: With dead ends: 1400 [2024-10-24 03:00:56,247 INFO L226 Difference]: Without dead ends: 871 [2024-10-24 03:00:56,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:56,250 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 0 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:56,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1825 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:00:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-24 03:00:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 864. [2024-10-24 03:00:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 766 states have (on average 1.4360313315926894) internal successors, (1100), 776 states have internal predecessors, (1100), 64 states have call successors, (64), 30 states have call predecessors, (64), 32 states have return successors, (79), 58 states have call predecessors, (79), 60 states have call successors, (79) [2024-10-24 03:00:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1243 transitions. [2024-10-24 03:00:56,298 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1243 transitions. Word has length 60 [2024-10-24 03:00:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:56,298 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1243 transitions. [2024-10-24 03:00:56,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 03:00:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1243 transitions. [2024-10-24 03:00:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 03:00:56,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:56,302 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 03:00:56,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 03:00:56,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-24 03:00:56,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:56,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash -800708452, now seen corresponding path program 1 times [2024-10-24 03:00:56,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:56,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348448560] [2024-10-24 03:00:56,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:56,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:56,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:00:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:56,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 03:00:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 03:00:56,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:56,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348448560] [2024-10-24 03:00:56,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348448560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:56,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:56,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 03:00:56,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301676849] [2024-10-24 03:00:56,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:56,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 03:00:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:56,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 03:00:56,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:56,592 INFO L87 Difference]: Start difference. First operand 864 states and 1243 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 03:00:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:57,180 INFO L93 Difference]: Finished difference Result 949 states and 1346 transitions. [2024-10-24 03:00:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:00:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-24 03:00:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:57,186 INFO L225 Difference]: With dead ends: 949 [2024-10-24 03:00:57,187 INFO L226 Difference]: Without dead ends: 946 [2024-10-24 03:00:57,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:00:57,188 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1502 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:57,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 726 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:00:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2024-10-24 03:00:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 863. [2024-10-24 03:00:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 766 states have (on average 1.433420365535248) internal successors, (1098), 775 states have internal predecessors, (1098), 63 states have call successors, (63), 30 states have call predecessors, (63), 32 states have return successors, (79), 58 states have call predecessors, (79), 60 states have call successors, (79) [2024-10-24 03:00:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1240 transitions. [2024-10-24 03:00:57,228 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1240 transitions. Word has length 60 [2024-10-24 03:00:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:57,229 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1240 transitions. [2024-10-24 03:00:57,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 03:00:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1240 transitions. [2024-10-24 03:00:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 03:00:57,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:57,230 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 03:00:57,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 03:00:57,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:57,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash 946408372, now seen corresponding path program 1 times [2024-10-24 03:00:57,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:57,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725927969] [2024-10-24 03:00:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:57,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:57,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:00:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 03:00:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 03:00:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725927969] [2024-10-24 03:00:57,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725927969] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:00:57,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330885265] [2024-10-24 03:00:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:57,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:00:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:00:57,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:00:57,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 03:00:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:57,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 03:00:57,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:00:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:00:57,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:00:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 03:00:57,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330885265] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:00:57,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:00:57,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-24 03:00:57,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782770837] [2024-10-24 03:00:57,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:00:57,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:00:57,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:57,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:00:57,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:00:57,830 INFO L87 Difference]: Start difference. First operand 863 states and 1240 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 03:00:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:58,810 INFO L93 Difference]: Finished difference Result 1666 states and 2275 transitions. [2024-10-24 03:00:58,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 03:00:58,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-24 03:00:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:58,818 INFO L225 Difference]: With dead ends: 1666 [2024-10-24 03:00:58,818 INFO L226 Difference]: Without dead ends: 1663 [2024-10-24 03:00:58,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 03:00:58,820 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 1094 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:58,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1684 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 03:00:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-10-24 03:00:58,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1166. [2024-10-24 03:00:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1033 states have (on average 1.3978702807357213) internal successors, (1444), 1048 states have internal predecessors, (1444), 82 states have call successors, (82), 43 states have call predecessors, (82), 49 states have return successors, (109), 75 states have call predecessors, (109), 79 states have call successors, (109) [2024-10-24 03:00:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1635 transitions. [2024-10-24 03:00:58,880 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1635 transitions. Word has length 61 [2024-10-24 03:00:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:58,881 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1635 transitions. [2024-10-24 03:00:58,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 03:00:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1635 transitions. [2024-10-24 03:00:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-24 03:00:58,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:58,883 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:58,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 03:00:59,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:00:59,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:59,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash -758325088, now seen corresponding path program 2 times [2024-10-24 03:00:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000448739] [2024-10-24 03:00:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:00:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 03:00:59,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 03:00:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 03:00:59,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:59,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000448739] [2024-10-24 03:00:59,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000448739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:00:59,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:00:59,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:00:59,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95047699] [2024-10-24 03:00:59,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:00:59,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:00:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:00:59,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:00:59,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:00:59,152 INFO L87 Difference]: Start difference. First operand 1166 states and 1635 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 03:00:59,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:00:59,696 INFO L93 Difference]: Finished difference Result 1794 states and 2452 transitions. [2024-10-24 03:00:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 03:00:59,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-24 03:00:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:00:59,702 INFO L225 Difference]: With dead ends: 1794 [2024-10-24 03:00:59,702 INFO L226 Difference]: Without dead ends: 1135 [2024-10-24 03:00:59,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:00:59,706 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 911 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:00:59,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 745 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 03:00:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-10-24 03:00:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1058. [2024-10-24 03:00:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 938 states have (on average 1.4029850746268657) internal successors, (1316), 953 states have internal predecessors, (1316), 75 states have call successors, (75), 38 states have call predecessors, (75), 43 states have return successors, (98), 67 states have call predecessors, (98), 72 states have call successors, (98) [2024-10-24 03:00:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1489 transitions. [2024-10-24 03:00:59,760 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1489 transitions. Word has length 78 [2024-10-24 03:00:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:00:59,762 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1489 transitions. [2024-10-24 03:00:59,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-24 03:00:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1489 transitions. [2024-10-24 03:00:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 03:00:59,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:00:59,765 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:00:59,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 03:00:59,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:00:59,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:00:59,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1647899131, now seen corresponding path program 1 times [2024-10-24 03:00:59,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:00:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445701315] [2024-10-24 03:00:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:00:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 03:00:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:00:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 03:00:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 03:00:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 03:00:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 03:00:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:00:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445701315] [2024-10-24 03:00:59,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445701315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:00:59,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795171765] [2024-10-24 03:00:59,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:00:59,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:00:59,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:00:59,877 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:00:59,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 03:00:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:00:59,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 03:00:59,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:01:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-24 03:01:00,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:01:00,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795171765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:00,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 03:01:00,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-24 03:01:00,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792301505] [2024-10-24 03:01:00,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:00,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 03:01:00,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:00,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 03:01:00,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:00,029 INFO L87 Difference]: Start difference. First operand 1058 states and 1489 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 03:01:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:00,165 INFO L93 Difference]: Finished difference Result 1341 states and 1845 transitions. [2024-10-24 03:01:00,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 03:01:00,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-24 03:01:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:00,168 INFO L225 Difference]: With dead ends: 1341 [2024-10-24 03:01:00,169 INFO L226 Difference]: Without dead ends: 354 [2024-10-24 03:01:00,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:00,171 INFO L432 NwaCegarLoop]: 644 mSDtfsCounter, 55 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:00,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1232 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:01:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-24 03:01:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-24 03:01:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 319 states have (on average 1.6394984326018809) internal successors, (523), 321 states have internal predecessors, (523), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 03:01:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 577 transitions. [2024-10-24 03:01:00,188 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 577 transitions. Word has length 92 [2024-10-24 03:01:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:00,189 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 577 transitions. [2024-10-24 03:01:00,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-24 03:01:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 577 transitions. [2024-10-24 03:01:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:00,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:00,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:00,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 03:01:00,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:01:00,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:00,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash -719527066, now seen corresponding path program 1 times [2024-10-24 03:01:00,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:00,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239331254] [2024-10-24 03:01:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:00,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:00,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:00,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-10-24 03:01:00,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:00,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239331254] [2024-10-24 03:01:00,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239331254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:00,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:00,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 03:01:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976624743] [2024-10-24 03:01:00,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:00,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 03:01:00,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:00,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 03:01:00,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:01:00,593 INFO L87 Difference]: Start difference. First operand 354 states and 577 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:02,303 INFO L93 Difference]: Finished difference Result 833 states and 1380 transitions. [2024-10-24 03:01:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:01:02,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:02,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:02,307 INFO L225 Difference]: With dead ends: 833 [2024-10-24 03:01:02,307 INFO L226 Difference]: Without dead ends: 484 [2024-10-24 03:01:02,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:02,309 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 991 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:02,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 651 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 03:01:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-24 03:01:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 354. [2024-10-24 03:01:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 319 states have (on average 1.6363636363636365) internal successors, (522), 321 states have internal predecessors, (522), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 03:01:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 576 transitions. [2024-10-24 03:01:02,334 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 576 transitions. Word has length 162 [2024-10-24 03:01:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:02,334 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 576 transitions. [2024-10-24 03:01:02,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:02,335 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 576 transitions. [2024-10-24 03:01:02,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:02,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:02,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:02,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 03:01:02,337 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:02,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:02,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1700481880, now seen corresponding path program 1 times [2024-10-24 03:01:02,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:02,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762587921] [2024-10-24 03:01:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:02,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:02,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:02,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:02,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:02,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:02,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762587921] [2024-10-24 03:01:02,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762587921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:02,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 03:01:02,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992365671] [2024-10-24 03:01:02,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:02,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 03:01:02,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:02,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 03:01:02,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:01:02,557 INFO L87 Difference]: Start difference. First operand 354 states and 576 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:04,176 INFO L93 Difference]: Finished difference Result 825 states and 1363 transitions. [2024-10-24 03:01:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 03:01:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:04,180 INFO L225 Difference]: With dead ends: 825 [2024-10-24 03:01:04,180 INFO L226 Difference]: Without dead ends: 484 [2024-10-24 03:01:04,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:01:04,182 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 982 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:04,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 649 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 03:01:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-24 03:01:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 354. [2024-10-24 03:01:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 319 states have (on average 1.6332288401253918) internal successors, (521), 321 states have internal predecessors, (521), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 03:01:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 575 transitions. [2024-10-24 03:01:04,206 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 575 transitions. Word has length 162 [2024-10-24 03:01:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:04,206 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 575 transitions. [2024-10-24 03:01:04,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 575 transitions. [2024-10-24 03:01:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:04,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:04,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:04,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 03:01:04,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:04,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1435834390, now seen corresponding path program 1 times [2024-10-24 03:01:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:04,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606419688] [2024-10-24 03:01:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:04,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:04,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:04,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606419688] [2024-10-24 03:01:04,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606419688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:04,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 03:01:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148529353] [2024-10-24 03:01:04,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:04,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:01:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:04,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:01:04,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:01:04,500 INFO L87 Difference]: Start difference. First operand 354 states and 575 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:07,382 INFO L93 Difference]: Finished difference Result 1303 states and 2165 transitions. [2024-10-24 03:01:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 03:01:07,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:07,387 INFO L225 Difference]: With dead ends: 1303 [2024-10-24 03:01:07,388 INFO L226 Difference]: Without dead ends: 968 [2024-10-24 03:01:07,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:01:07,389 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1492 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:07,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1097 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 03:01:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2024-10-24 03:01:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 707. [2024-10-24 03:01:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 644 states have (on average 1.6444099378881987) internal successors, (1059), 647 states have internal predecessors, (1059), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-10-24 03:01:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1158 transitions. [2024-10-24 03:01:07,438 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1158 transitions. Word has length 162 [2024-10-24 03:01:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:07,439 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1158 transitions. [2024-10-24 03:01:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1158 transitions. [2024-10-24 03:01:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:07,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:07,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:07,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 03:01:07,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:07,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 653764522, now seen corresponding path program 1 times [2024-10-24 03:01:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:07,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755814421] [2024-10-24 03:01:07,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:07,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:07,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755814421] [2024-10-24 03:01:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755814421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:07,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:07,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312892680] [2024-10-24 03:01:07,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:07,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:07,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:07,744 INFO L87 Difference]: Start difference. First operand 707 states and 1158 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:11,329 INFO L93 Difference]: Finished difference Result 2158 states and 3591 transitions. [2024-10-24 03:01:11,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:11,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:11,336 INFO L225 Difference]: With dead ends: 2158 [2024-10-24 03:01:11,336 INFO L226 Difference]: Without dead ends: 1470 [2024-10-24 03:01:11,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:01:11,339 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1525 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3747 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 3812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:11,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 2097 Invalid, 3812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3747 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 03:01:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2024-10-24 03:01:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1033. [2024-10-24 03:01:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 942 states have (on average 1.638004246284501) internal successors, (1543), 946 states have internal predecessors, (1543), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-10-24 03:01:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1686 transitions. [2024-10-24 03:01:11,413 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1686 transitions. Word has length 162 [2024-10-24 03:01:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:11,413 INFO L471 AbstractCegarLoop]: Abstraction has 1033 states and 1686 transitions. [2024-10-24 03:01:11,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1686 transitions. [2024-10-24 03:01:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:11,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:11,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:11,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 03:01:11,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:11,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1064374888, now seen corresponding path program 1 times [2024-10-24 03:01:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:11,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350435492] [2024-10-24 03:01:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:11,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:11,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:11,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:11,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350435492] [2024-10-24 03:01:11,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350435492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:11,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:11,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:11,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174711426] [2024-10-24 03:01:11,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:11,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:11,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:11,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:11,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:11,721 INFO L87 Difference]: Start difference. First operand 1033 states and 1686 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:15,490 INFO L93 Difference]: Finished difference Result 3411 states and 5667 transitions. [2024-10-24 03:01:15,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:15,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:15,500 INFO L225 Difference]: With dead ends: 3411 [2024-10-24 03:01:15,501 INFO L226 Difference]: Without dead ends: 2397 [2024-10-24 03:01:15,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:01:15,504 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1523 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:15,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 2095 Invalid, 3810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 03:01:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2024-10-24 03:01:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1686. [2024-10-24 03:01:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1539 states have (on average 1.632228719948018) internal successors, (2512), 1545 states have internal predecessors, (2512), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-24 03:01:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2747 transitions. [2024-10-24 03:01:15,632 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2747 transitions. Word has length 162 [2024-10-24 03:01:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:15,633 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2747 transitions. [2024-10-24 03:01:15,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2747 transitions. [2024-10-24 03:01:15,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:15,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:15,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:15,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 03:01:15,636 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:15,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:15,636 INFO L85 PathProgramCache]: Analyzing trace with hash -723494934, now seen corresponding path program 1 times [2024-10-24 03:01:15,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:15,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017990770] [2024-10-24 03:01:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:15,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:15,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:15,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:15,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017990770] [2024-10-24 03:01:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017990770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532411121] [2024-10-24 03:01:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:15,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:15,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:15,934 INFO L87 Difference]: Start difference. First operand 1686 states and 2747 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:17,608 INFO L93 Difference]: Finished difference Result 4052 states and 6719 transitions. [2024-10-24 03:01:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:01:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:17,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:17,622 INFO L225 Difference]: With dead ends: 4052 [2024-10-24 03:01:17,622 INFO L226 Difference]: Without dead ends: 2385 [2024-10-24 03:01:17,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:01:17,628 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 1244 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:17,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 900 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 03:01:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2024-10-24 03:01:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1686. [2024-10-24 03:01:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1539 states have (on average 1.6289798570500325) internal successors, (2507), 1545 states have internal predecessors, (2507), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-24 03:01:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2742 transitions. [2024-10-24 03:01:17,788 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2742 transitions. Word has length 162 [2024-10-24 03:01:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:17,788 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2742 transitions. [2024-10-24 03:01:17,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2742 transitions. [2024-10-24 03:01:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:17,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:17,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:17,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 03:01:17,791 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:17,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1435589160, now seen corresponding path program 1 times [2024-10-24 03:01:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704654359] [2024-10-24 03:01:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:18,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:18,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:18,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:18,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704654359] [2024-10-24 03:01:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704654359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:18,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:18,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:18,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144168905] [2024-10-24 03:01:18,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:18,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:18,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:18,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:18,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:18,053 INFO L87 Difference]: Start difference. First operand 1686 states and 2742 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:19,942 INFO L93 Difference]: Finished difference Result 4046 states and 6693 transitions. [2024-10-24 03:01:19,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:01:19,942 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:19,954 INFO L225 Difference]: With dead ends: 4046 [2024-10-24 03:01:19,955 INFO L226 Difference]: Without dead ends: 2379 [2024-10-24 03:01:19,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:01:19,960 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 1180 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:19,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 1070 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 03:01:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2024-10-24 03:01:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1686. [2024-10-24 03:01:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1539 states have (on average 1.6257309941520468) internal successors, (2502), 1545 states have internal predecessors, (2502), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-10-24 03:01:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2737 transitions. [2024-10-24 03:01:20,100 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2737 transitions. Word has length 162 [2024-10-24 03:01:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:20,100 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2737 transitions. [2024-10-24 03:01:20,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2737 transitions. [2024-10-24 03:01:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:20,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:20,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 03:01:20,103 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1505237034, now seen corresponding path program 1 times [2024-10-24 03:01:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:20,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096964568] [2024-10-24 03:01:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:20,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:20,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096964568] [2024-10-24 03:01:20,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096964568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:20,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:20,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:20,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729122539] [2024-10-24 03:01:20,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:20,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:20,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:20,376 INFO L87 Difference]: Start difference. First operand 1686 states and 2737 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:23,892 INFO L93 Difference]: Finished difference Result 5793 states and 9544 transitions. [2024-10-24 03:01:23,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:23,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:23,910 INFO L225 Difference]: With dead ends: 5793 [2024-10-24 03:01:23,911 INFO L226 Difference]: Without dead ends: 4126 [2024-10-24 03:01:23,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:01:23,916 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1509 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3662 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1528 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:23,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1528 Valid, 2095 Invalid, 3729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3662 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 03:01:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2024-10-24 03:01:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 3006. [2024-10-24 03:01:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 2747 states have (on average 1.620677102293411) internal successors, (4452), 2757 states have internal predecessors, (4452), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-24 03:01:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4877 transitions. [2024-10-24 03:01:24,198 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4877 transitions. Word has length 162 [2024-10-24 03:01:24,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:24,198 INFO L471 AbstractCegarLoop]: Abstraction has 3006 states and 4877 transitions. [2024-10-24 03:01:24,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4877 transitions. [2024-10-24 03:01:24,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:24,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:24,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:24,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 03:01:24,202 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:24,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1390776660, now seen corresponding path program 1 times [2024-10-24 03:01:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:24,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400685897] [2024-10-24 03:01:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:24,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:24,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:24,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:24,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:24,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400685897] [2024-10-24 03:01:24,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400685897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:24,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:24,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:24,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122857501] [2024-10-24 03:01:24,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:24,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:24,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:24,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:24,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:24,438 INFO L87 Difference]: Start difference. First operand 3006 states and 4877 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:26,069 INFO L93 Difference]: Finished difference Result 7136 states and 11757 transitions. [2024-10-24 03:01:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:01:26,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:26,092 INFO L225 Difference]: With dead ends: 7136 [2024-10-24 03:01:26,092 INFO L226 Difference]: Without dead ends: 4149 [2024-10-24 03:01:26,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:01:26,102 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 1245 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:26,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 900 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 03:01:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2024-10-24 03:01:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 3006. [2024-10-24 03:01:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 2747 states have (on average 1.6174008008736804) internal successors, (4443), 2757 states have internal predecessors, (4443), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-10-24 03:01:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4868 transitions. [2024-10-24 03:01:26,391 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4868 transitions. Word has length 162 [2024-10-24 03:01:26,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:26,391 INFO L471 AbstractCegarLoop]: Abstraction has 3006 states and 4868 transitions. [2024-10-24 03:01:26,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:26,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4868 transitions. [2024-10-24 03:01:26,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:26,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:26,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:26,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 03:01:26,396 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:26,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:26,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1286750186, now seen corresponding path program 1 times [2024-10-24 03:01:26,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:26,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768674461] [2024-10-24 03:01:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:26,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:26,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768674461] [2024-10-24 03:01:26,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768674461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:26,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:26,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272278804] [2024-10-24 03:01:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:26,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:26,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:26,659 INFO L87 Difference]: Start difference. First operand 3006 states and 4868 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:30,215 INFO L93 Difference]: Finished difference Result 10585 states and 17370 transitions. [2024-10-24 03:01:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:30,247 INFO L225 Difference]: With dead ends: 10585 [2024-10-24 03:01:30,247 INFO L226 Difference]: Without dead ends: 7598 [2024-10-24 03:01:30,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:01:30,259 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1501 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3624 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:30,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 2095 Invalid, 3691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3624 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 03:01:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2024-10-24 03:01:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 5656. [2024-10-24 03:01:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5656 states, 5173 states have (on average 1.6127972163154842) internal successors, (8343), 5191 states have internal predecessors, (8343), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-10-24 03:01:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5656 states to 5656 states and 9166 transitions. [2024-10-24 03:01:30,824 INFO L78 Accepts]: Start accepts. Automaton has 5656 states and 9166 transitions. Word has length 162 [2024-10-24 03:01:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:30,825 INFO L471 AbstractCegarLoop]: Abstraction has 5656 states and 9166 transitions. [2024-10-24 03:01:30,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:30,825 INFO L276 IsEmpty]: Start isEmpty. Operand 5656 states and 9166 transitions. [2024-10-24 03:01:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:30,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:30,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:30,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 03:01:30,830 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:30,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1650216684, now seen corresponding path program 1 times [2024-10-24 03:01:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:30,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21806035] [2024-10-24 03:01:30,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:30,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:30,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21806035] [2024-10-24 03:01:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21806035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874526300] [2024-10-24 03:01:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:31,088 INFO L87 Difference]: Start difference. First operand 5656 states and 9166 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:35,093 INFO L93 Difference]: Finished difference Result 20185 states and 33154 transitions. [2024-10-24 03:01:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:35,094 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:35,146 INFO L225 Difference]: With dead ends: 20185 [2024-10-24 03:01:35,147 INFO L226 Difference]: Without dead ends: 14548 [2024-10-24 03:01:35,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:01:35,166 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1500 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3611 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:35,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 2095 Invalid, 3678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3611 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 03:01:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14548 states. [2024-10-24 03:01:35,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14548 to 10969. [2024-10-24 03:01:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10969 states, 10038 states have (on average 1.609982068141064) internal successors, (16161), 10072 states have internal predecessors, (16161), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-10-24 03:01:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10969 states to 10969 states and 17834 transitions. [2024-10-24 03:01:35,920 INFO L78 Accepts]: Start accepts. Automaton has 10969 states and 17834 transitions. Word has length 162 [2024-10-24 03:01:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:35,920 INFO L471 AbstractCegarLoop]: Abstraction has 10969 states and 17834 transitions. [2024-10-24 03:01:35,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10969 states and 17834 transitions. [2024-10-24 03:01:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:35,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:35,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:35,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 03:01:35,929 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:35,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1939036074, now seen corresponding path program 1 times [2024-10-24 03:01:35,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:35,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269608570] [2024-10-24 03:01:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:36,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269608570] [2024-10-24 03:01:36,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269608570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:36,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939982974] [2024-10-24 03:01:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:36,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:36,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:36,214 INFO L87 Difference]: Start difference. First operand 10969 states and 17834 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:41,329 INFO L93 Difference]: Finished difference Result 39384 states and 64912 transitions. [2024-10-24 03:01:41,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 03:01:41,330 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:41,414 INFO L225 Difference]: With dead ends: 39384 [2024-10-24 03:01:41,414 INFO L226 Difference]: Without dead ends: 28434 [2024-10-24 03:01:41,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 03:01:41,449 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1499 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 3598 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 3665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:41,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 2095 Invalid, 3665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3598 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 03:01:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2024-10-24 03:01:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 21626. [2024-10-24 03:01:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21626 states, 19799 states have (on average 1.608313551189454) internal successors, (31843), 19865 states have internal predecessors, (31843), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-24 03:01:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21626 states to 21626 states and 35378 transitions. [2024-10-24 03:01:43,299 INFO L78 Accepts]: Start accepts. Automaton has 21626 states and 35378 transitions. Word has length 162 [2024-10-24 03:01:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:43,299 INFO L471 AbstractCegarLoop]: Abstraction has 21626 states and 35378 transitions. [2024-10-24 03:01:43,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21626 states and 35378 transitions. [2024-10-24 03:01:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:43,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:43,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 03:01:43,317 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1394163500, now seen corresponding path program 1 times [2024-10-24 03:01:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032930744] [2024-10-24 03:01:43,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:43,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:43,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:43,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:43,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:43,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032930744] [2024-10-24 03:01:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032930744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:43,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467775696] [2024-10-24 03:01:43,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:43,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:43,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:43,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:43,613 INFO L87 Difference]: Start difference. First operand 21626 states and 35378 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:47,073 INFO L93 Difference]: Finished difference Result 50472 states and 83964 transitions. [2024-10-24 03:01:47,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:01:47,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:47,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:47,193 INFO L225 Difference]: With dead ends: 50472 [2024-10-24 03:01:47,193 INFO L226 Difference]: Without dead ends: 28865 [2024-10-24 03:01:47,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:01:47,386 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 1246 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:47,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 900 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 03:01:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28865 states. [2024-10-24 03:01:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28865 to 21626. [2024-10-24 03:01:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21626 states, 19799 states have (on average 1.6050305570988435) internal successors, (31778), 19865 states have internal predecessors, (31778), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-24 03:01:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21626 states to 21626 states and 35313 transitions. [2024-10-24 03:01:49,471 INFO L78 Accepts]: Start accepts. Automaton has 21626 states and 35313 transitions. Word has length 162 [2024-10-24 03:01:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:49,471 INFO L471 AbstractCegarLoop]: Abstraction has 21626 states and 35313 transitions. [2024-10-24 03:01:49,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 21626 states and 35313 transitions. [2024-10-24 03:01:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:49,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:49,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:49,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 03:01:49,493 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:49,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2069323626, now seen corresponding path program 1 times [2024-10-24 03:01:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646809417] [2024-10-24 03:01:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:49,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:49,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:49,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646809417] [2024-10-24 03:01:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646809417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590783434] [2024-10-24 03:01:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:49,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:49,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:49,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:49,790 INFO L87 Difference]: Start difference. First operand 21626 states and 35313 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:01:53,361 INFO L93 Difference]: Finished difference Result 50406 states and 83637 transitions. [2024-10-24 03:01:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:01:53,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2024-10-24 03:01:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:01:53,493 INFO L225 Difference]: With dead ends: 50406 [2024-10-24 03:01:53,493 INFO L226 Difference]: Without dead ends: 28799 [2024-10-24 03:01:53,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 03:01:53,557 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 1150 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:01:53,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1070 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 03:01:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28799 states. [2024-10-24 03:01:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28799 to 21626. [2024-10-24 03:01:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21626 states, 19799 states have (on average 1.6017475630082327) internal successors, (31713), 19865 states have internal predecessors, (31713), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 454 states have return successors, (2163), 1433 states have call predecessors, (2163), 1370 states have call successors, (2163) [2024-10-24 03:01:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21626 states to 21626 states and 35248 transitions. [2024-10-24 03:01:56,121 INFO L78 Accepts]: Start accepts. Automaton has 21626 states and 35248 transitions. Word has length 162 [2024-10-24 03:01:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:01:56,122 INFO L471 AbstractCegarLoop]: Abstraction has 21626 states and 35248 transitions. [2024-10-24 03:01:56,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 03:01:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21626 states and 35248 transitions. [2024-10-24 03:01:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 03:01:56,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:01:56,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:01:56,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 03:01:56,137 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:01:56,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:01:56,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1121271660, now seen corresponding path program 1 times [2024-10-24 03:01:56,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:01:56,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458384605] [2024-10-24 03:01:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:01:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:01:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 03:01:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 03:01:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 03:01:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 03:01:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-24 03:01:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:01:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:01:56,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:01:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458384605] [2024-10-24 03:01:56,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458384605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:01:56,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:01:56,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 03:01:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931937228] [2024-10-24 03:01:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:01:56,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 03:01:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:01:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 03:01:56,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:01:56,530 INFO L87 Difference]: Start difference. First operand 21626 states and 35248 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 5 states have internal predecessors, (151), 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)