./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.14.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bef365bd29db1ac20249b1e3139137560ac4134ff54f631658e57cc437eb0ce --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 17:15:05,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:15:05,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:15:05,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:15:05,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:15:05,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:15:05,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:15:05,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:15:05,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:15:05,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:15:05,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:15:05,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:15:05,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:15:05,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:15:05,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:15:05,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:15:05,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:15:05,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:15:05,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:15:05,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:15:05,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:15:05,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:15:05,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:15:05,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:15:05,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:15:05,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:15:05,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:15:05,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:15:05,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:15:05,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:15:05,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:15:05,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:15:05,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:15:05,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:15:05,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:15:05,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:15:05,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:15:05,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:15:05,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:15:05,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:15:05,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:15:05,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:15:05,299 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 -> 0bef365bd29db1ac20249b1e3139137560ac4134ff54f631658e57cc437eb0ce [2024-11-08 17:15:05,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:15:05,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:15:05,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:15:05,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:15:05,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:15:05,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.14.cil.c [2024-11-08 17:15:06,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:15:06,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:15:06,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.14.cil.c [2024-11-08 17:15:06,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58085bc84/94a29e545c004e2faf62f581303a88c9/FLAGbd9f3f758 [2024-11-08 17:15:06,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58085bc84/94a29e545c004e2faf62f581303a88c9 [2024-11-08 17:15:06,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:15:06,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:15:06,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:15:06,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:15:06,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:15:06,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:15:06" (1/1) ... [2024-11-08 17:15:06,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369b0ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:06, skipping insertion in model container [2024-11-08 17:15:06,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:15:06" (1/1) ... [2024-11-08 17:15:06,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:15:07,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.14.cil.c[913,926] [2024-11-08 17:15:07,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.14.cil.c[5977,5990] [2024-11-08 17:15:07,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:15:07,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:15:07,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.14.cil.c[913,926] [2024-11-08 17:15:07,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.14.cil.c[5977,5990] [2024-11-08 17:15:07,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:15:07,375 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:15:07,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07 WrapperNode [2024-11-08 17:15:07,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:15:07,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:15:07,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:15:07,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:15:07,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,431 INFO L138 Inliner]: procedures = 72, calls = 85, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1087 [2024-11-08 17:15:07,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:15:07,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:15:07,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:15:07,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:15:07,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,461 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 17:15:07,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:15:07,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:15:07,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:15:07,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:15:07,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (1/1) ... [2024-11-08 17:15:07,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:15:07,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:15:07,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:15:07,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:15:07,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:15:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 17:15:07,575 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 17:15:07,575 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-11-08 17:15:07,576 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-11-08 17:15:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-08 17:15:07,576 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-08 17:15:07,576 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-08 17:15:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-08 17:15:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-08 17:15:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-08 17:15:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-08 17:15:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-08 17:15:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-08 17:15:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-08 17:15:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:15:07,577 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-08 17:15:07,578 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-08 17:15:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:15:07,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:15:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-08 17:15:07,578 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-08 17:15:07,578 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-08 17:15:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-08 17:15:07,681 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:15:07,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:15:08,467 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-08 17:15:08,469 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:15:08,494 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:15:08,494 INFO L316 CfgBuilder]: Removed 19 assume(true) statements. [2024-11-08 17:15:08,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:15:08 BoogieIcfgContainer [2024-11-08 17:15:08,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:15:08,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:15:08,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:15:08,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:15:08,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:15:06" (1/3) ... [2024-11-08 17:15:08,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8e29c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:15:08, skipping insertion in model container [2024-11-08 17:15:08,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:07" (2/3) ... [2024-11-08 17:15:08,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8e29c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:15:08, skipping insertion in model container [2024-11-08 17:15:08,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:15:08" (3/3) ... [2024-11-08 17:15:08,503 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.14.cil.c [2024-11-08 17:15:08,515 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:15:08,515 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 17:15:08,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:15:08,589 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;@3ae6680b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:15:08,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 17:15:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 473 states, 426 states have (on average 1.6314553990610328) internal successors, (695), 433 states have internal predecessors, (695), 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-11-08 17:15:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 17:15:08,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:08,604 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] [2024-11-08 17:15:08,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:08,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1921495546, now seen corresponding path program 1 times [2024-11-08 17:15:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:08,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597000697] [2024-11-08 17:15:08,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:08,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:08,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 17:15:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:08,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:08,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597000697] [2024-11-08 17:15:08,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597000697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:08,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:08,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:08,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518609942] [2024-11-08 17:15:08,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:08,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:09,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:09,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:09,015 INFO L87 Difference]: Start difference. First operand has 473 states, 426 states have (on average 1.6314553990610328) internal successors, (695), 433 states have internal predecessors, (695), 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 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-08 17:15:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:09,551 INFO L93 Difference]: Finished difference Result 990 states and 1594 transitions. [2024-11-08 17:15:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:15:09,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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 44 [2024-11-08 17:15:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:09,568 INFO L225 Difference]: With dead ends: 990 [2024-11-08 17:15:09,568 INFO L226 Difference]: Without dead ends: 532 [2024-11-08 17:15:09,574 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-11-08 17:15:09,576 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 965 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:09,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 881 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:15:09,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-08 17:15:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2024-11-08 17:15:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 475 states have (on average 1.52) internal successors, (722), 480 states have internal predecessors, (722), 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-11-08 17:15:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 800 transitions. [2024-11-08 17:15:09,650 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 800 transitions. Word has length 44 [2024-11-08 17:15:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:09,651 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 800 transitions. [2024-11-08 17:15:09,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-11-08 17:15:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 800 transitions. [2024-11-08 17:15:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 17:15:09,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:09,653 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] [2024-11-08 17:15:09,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:15:09,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:09,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:09,654 INFO L85 PathProgramCache]: Analyzing trace with hash -542333185, now seen corresponding path program 1 times [2024-11-08 17:15:09,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164054699] [2024-11-08 17:15:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:09,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:15:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:09,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:09,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164054699] [2024-11-08 17:15:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164054699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165065604] [2024-11-08 17:15:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:09,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:09,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:09,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:09,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:09,768 INFO L87 Difference]: Start difference. First operand 526 states and 800 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-08 17:15:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:10,256 INFO L93 Difference]: Finished difference Result 774 states and 1140 transitions. [2024-11-08 17:15:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:15:10,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-08 17:15:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:10,263 INFO L225 Difference]: With dead ends: 774 [2024-11-08 17:15:10,263 INFO L226 Difference]: Without dead ends: 650 [2024-11-08 17:15:10,263 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-11-08 17:15:10,264 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 370 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:10,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1232 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-11-08 17:15:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 593. [2024-11-08 17:15:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 536 states have (on average 1.5037313432835822) internal successors, (806), 541 states have internal predecessors, (806), 41 states have call successors, (41), 15 states have call predecessors, (41), 14 states have return successors, (43), 37 states have call predecessors, (43), 37 states have call successors, (43) [2024-11-08 17:15:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 890 transitions. [2024-11-08 17:15:10,299 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 890 transitions. Word has length 45 [2024-11-08 17:15:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:10,299 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 890 transitions. [2024-11-08 17:15:10,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-08 17:15:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 890 transitions. [2024-11-08 17:15:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 17:15:10,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:10,301 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] [2024-11-08 17:15:10,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:15:10,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1826690646, now seen corresponding path program 1 times [2024-11-08 17:15:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590163673] [2024-11-08 17:15:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 17:15:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:10,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590163673] [2024-11-08 17:15:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590163673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:10,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:10,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426569957] [2024-11-08 17:15:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:10,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:10,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:10,378 INFO L87 Difference]: Start difference. First operand 593 states and 890 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-08 17:15:10,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:10,757 INFO L93 Difference]: Finished difference Result 1001 states and 1449 transitions. [2024-11-08 17:15:10,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:15:10,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 45 [2024-11-08 17:15:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:10,761 INFO L225 Difference]: With dead ends: 1001 [2024-11-08 17:15:10,762 INFO L226 Difference]: Without dead ends: 810 [2024-11-08 17:15:10,763 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-11-08 17:15:10,766 INFO L432 NwaCegarLoop]: 451 mSDtfsCounter, 975 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:10,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 881 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:15:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2024-11-08 17:15:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 758. [2024-11-08 17:15:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 682 states have (on average 1.4604105571847508) internal successors, (996), 690 states have internal predecessors, (996), 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-11-08 17:15:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1108 transitions. [2024-11-08 17:15:10,802 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1108 transitions. Word has length 45 [2024-11-08 17:15:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:10,802 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1108 transitions. [2024-11-08 17:15:10,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-11-08 17:15:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1108 transitions. [2024-11-08 17:15:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 17:15:10,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:10,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:10,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:15:10,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:10,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2062777962, now seen corresponding path program 1 times [2024-11-08 17:15:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:10,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614332577] [2024-11-08 17:15:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:10,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 17:15:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:10,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 17:15:10,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:10,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614332577] [2024-11-08 17:15:10,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614332577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:10,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:10,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118487012] [2024-11-08 17:15:10,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:10,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:10,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:10,908 INFO L87 Difference]: Start difference. First operand 758 states and 1108 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-08 17:15:11,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:11,392 INFO L93 Difference]: Finished difference Result 1342 states and 1893 transitions. [2024-11-08 17:15:11,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:15:11,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 62 [2024-11-08 17:15:11,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:11,397 INFO L225 Difference]: With dead ends: 1342 [2024-11-08 17:15:11,397 INFO L226 Difference]: Without dead ends: 986 [2024-11-08 17:15:11,398 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-11-08 17:15:11,398 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 354 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:11,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1285 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-11-08 17:15:11,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 948. [2024-11-08 17:15:11,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 848 states have (on average 1.4103773584905661) internal successors, (1196), 858 states have internal predecessors, (1196), 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-11-08 17:15:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1346 transitions. [2024-11-08 17:15:11,429 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1346 transitions. Word has length 62 [2024-11-08 17:15:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:11,429 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1346 transitions. [2024-11-08 17:15:11,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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-11-08 17:15:11,430 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1346 transitions. [2024-11-08 17:15:11,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-08 17:15:11,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:11,431 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:11,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:15:11,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:11,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2096414060, now seen corresponding path program 1 times [2024-11-08 17:15:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826556635] [2024-11-08 17:15:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:11,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:11,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:15:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:11,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 17:15:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 17:15:11,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:11,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826556635] [2024-11-08 17:15:11,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826556635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:11,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:11,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:15:11,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119930398] [2024-11-08 17:15:11,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:11,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:11,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:11,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:11,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:15:11,481 INFO L87 Difference]: Start difference. First operand 948 states and 1346 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-08 17:15:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:11,854 INFO L93 Difference]: Finished difference Result 1601 states and 2199 transitions. [2024-11-08 17:15:11,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:15:11,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 67 [2024-11-08 17:15:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:11,861 INFO L225 Difference]: With dead ends: 1601 [2024-11-08 17:15:11,862 INFO L226 Difference]: Without dead ends: 1147 [2024-11-08 17:15:11,863 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-11-08 17:15:11,864 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 962 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:11,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 880 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:15:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2024-11-08 17:15:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1092. [2024-11-08 17:15:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 976 states have (on average 1.3801229508196722) internal successors, (1347), 988 states have internal predecessors, (1347), 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-11-08 17:15:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1519 transitions. [2024-11-08 17:15:11,926 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1519 transitions. Word has length 67 [2024-11-08 17:15:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:11,926 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1519 transitions. [2024-11-08 17:15:11,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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-11-08 17:15:11,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1519 transitions. [2024-11-08 17:15:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-08 17:15:11,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:11,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:11,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:15:11,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:11,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1043129785, now seen corresponding path program 1 times [2024-11-08 17:15:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:11,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177489994] [2024-11-08 17:15:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:11,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 17:15:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:15:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:15:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177489994] [2024-11-08 17:15:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177489994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:15:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309768621] [2024-11-08 17:15:12,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:12,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:15:12,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:15:12,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:15:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 17:15:12,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:15:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:12,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:15:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 17:15:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309768621] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 17:15:12,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:15:12,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2024-11-08 17:15:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450270751] [2024-11-08 17:15:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:15:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:12,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:15:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:12,281 INFO L87 Difference]: Start difference. First operand 1092 states and 1519 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:12,433 INFO L93 Difference]: Finished difference Result 1148 states and 1587 transitions. [2024-11-08 17:15:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:15:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 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 68 [2024-11-08 17:15:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:12,438 INFO L225 Difference]: With dead ends: 1148 [2024-11-08 17:15:12,438 INFO L226 Difference]: Without dead ends: 1145 [2024-11-08 17:15:12,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:15:12,440 INFO L432 NwaCegarLoop]: 733 mSDtfsCounter, 1297 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:12,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 800 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:15:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-08 17:15:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1091. [2024-11-08 17:15:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 976 states have (on average 1.3780737704918034) internal successors, (1345), 987 states have internal predecessors, (1345), 73 states have call successors, (73), 36 states have call predecessors, (73), 40 states have return successors, (98), 68 states have call predecessors, (98), 70 states have call successors, (98) [2024-11-08 17:15:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1516 transitions. [2024-11-08 17:15:12,481 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1516 transitions. Word has length 68 [2024-11-08 17:15:12,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:12,482 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1516 transitions. [2024-11-08 17:15:12,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 17:15:12,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1516 transitions. [2024-11-08 17:15:12,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 17:15:12,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:12,484 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:12,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:15:12,684 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-11-08 17:15:12,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:12,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2024136905, now seen corresponding path program 1 times [2024-11-08 17:15:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165911064] [2024-11-08 17:15:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:12,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 17:15:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 17:15:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 17:15:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165911064] [2024-11-08 17:15:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165911064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:15:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583742763] [2024-11-08 17:15:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:12,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:12,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:15:12,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:15:12,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:15:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:12,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:15:12,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:15:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:13,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:15:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 17:15:13,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583742763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:15:13,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:15:13,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2024-11-08 17:15:13,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88005682] [2024-11-08 17:15:13,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:15:13,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:15:13,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:15:13,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:13,178 INFO L87 Difference]: Start difference. First operand 1091 states and 1516 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 17:15:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:14,441 INFO L93 Difference]: Finished difference Result 2598 states and 3504 transitions. [2024-11-08 17:15:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 17:15:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2024-11-08 17:15:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:14,448 INFO L225 Difference]: With dead ends: 2598 [2024-11-08 17:15:14,448 INFO L226 Difference]: Without dead ends: 2054 [2024-11-08 17:15:14,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-08 17:15:14,450 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 1729 mSDsluCounter, 3327 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 3847 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:14,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1762 Valid, 3847 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:15:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2024-11-08 17:15:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1454. [2024-11-08 17:15:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1300 states have (on average 1.3423076923076922) internal successors, (1745), 1319 states have internal predecessors, (1745), 93 states have call successors, (93), 50 states have call predecessors, (93), 59 states have return successors, (132), 85 states have call predecessors, (132), 90 states have call successors, (132) [2024-11-08 17:15:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1970 transitions. [2024-11-08 17:15:14,499 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1970 transitions. Word has length 69 [2024-11-08 17:15:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:14,500 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 1970 transitions. [2024-11-08 17:15:14,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 17:15:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1970 transitions. [2024-11-08 17:15:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 17:15:14,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:14,502 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2024-11-08 17:15:14,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 17:15:14,703 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-11-08 17:15:14,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:14,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:14,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1335038024, now seen corresponding path program 1 times [2024-11-08 17:15:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:14,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057042147] [2024-11-08 17:15:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:14,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:14,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 17:15:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 17:15:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 17:15:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057042147] [2024-11-08 17:15:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057042147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:15:14,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728361969] [2024-11-08 17:15:14,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:14,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:14,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:15:14,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:15:14,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:15:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:14,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:15:14,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:15:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 17:15:14,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:15:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728361969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:15:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-08 17:15:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796616503] [2024-11-08 17:15:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:14,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:15:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:15:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:14,906 INFO L87 Difference]: Start difference. First operand 1454 states and 1970 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:15:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:14,947 INFO L93 Difference]: Finished difference Result 2151 states and 2874 transitions. [2024-11-08 17:15:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:15:14,947 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2024-11-08 17:15:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:14,952 INFO L225 Difference]: With dead ends: 2151 [2024-11-08 17:15:14,952 INFO L226 Difference]: Without dead ends: 1332 [2024-11-08 17:15:14,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:14,954 INFO L432 NwaCegarLoop]: 739 mSDtfsCounter, 669 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:14,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 814 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:15:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-08 17:15:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1317. [2024-11-08 17:15:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1179 states have (on average 1.3460559796437659) internal successors, (1587), 1197 states have internal predecessors, (1587), 85 states have call successors, (85), 44 states have call predecessors, (85), 51 states have return successors, (118), 76 states have call predecessors, (118), 82 states have call successors, (118) [2024-11-08 17:15:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1790 transitions. [2024-11-08 17:15:15,025 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1790 transitions. Word has length 88 [2024-11-08 17:15:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:15,025 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1790 transitions. [2024-11-08 17:15:15,025 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, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 17:15:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1790 transitions. [2024-11-08 17:15:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 17:15:15,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:15,028 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 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-11-08 17:15:15,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:15:15,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:15,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:15,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:15,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1839711785, now seen corresponding path program 1 times [2024-11-08 17:15:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:15,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419668234] [2024-11-08 17:15:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:15,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 17:15:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 17:15:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 17:15:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:15:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 17:15:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419668234] [2024-11-08 17:15:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419668234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:15:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351690782] [2024-11-08 17:15:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:15,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:15,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:15:15,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:15:15,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:15:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:15:15,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:15:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 17:15:15,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:15:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351690782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:15:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-08 17:15:15,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698549426] [2024-11-08 17:15:15,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:15,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:15:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:15,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:15:15,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:15,428 INFO L87 Difference]: Start difference. First operand 1317 states and 1790 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-08 17:15:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:15,461 INFO L93 Difference]: Finished difference Result 1696 states and 2258 transitions. [2024-11-08 17:15:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:15:15,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 103 [2024-11-08 17:15:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:15,463 INFO L225 Difference]: With dead ends: 1696 [2024-11-08 17:15:15,463 INFO L226 Difference]: Without dead ends: 396 [2024-11-08 17:15:15,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:15,467 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 62 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:15,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1438 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:15:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-08 17:15:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-08 17:15:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.559556786703601) internal successors, (563), 363 states have internal predecessors, (563), 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-11-08 17:15:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 617 transitions. [2024-11-08 17:15:15,477 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 617 transitions. Word has length 103 [2024-11-08 17:15:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:15,477 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 617 transitions. [2024-11-08 17:15:15,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-11-08 17:15:15,478 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 617 transitions. [2024-11-08 17:15:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:15,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:15,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:15,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:15:15,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:15,684 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:15,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1960994089, now seen corresponding path program 1 times [2024-11-08 17:15:15,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:15,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837493788] [2024-11-08 17:15:15,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:15,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:15,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837493788] [2024-11-08 17:15:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837493788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:15,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:15,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:15:15,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865630888] [2024-11-08 17:15:15,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:15,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:15:15,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:15,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:15:15,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:15:15,833 INFO L87 Difference]: Start difference. First operand 396 states and 617 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:17,175 INFO L93 Difference]: Finished difference Result 927 states and 1470 transitions. [2024-11-08 17:15:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:15:17,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:17,177 INFO L225 Difference]: With dead ends: 927 [2024-11-08 17:15:17,177 INFO L226 Difference]: Without dead ends: 538 [2024-11-08 17:15:17,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:17,179 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1057 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:17,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 792 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:15:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-08 17:15:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 396. [2024-11-08 17:15:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.556786703601108) internal successors, (562), 363 states have internal predecessors, (562), 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-11-08 17:15:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 616 transitions. [2024-11-08 17:15:17,198 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 616 transitions. Word has length 179 [2024-11-08 17:15:17,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:17,198 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 616 transitions. [2024-11-08 17:15:17,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 616 transitions. [2024-11-08 17:15:17,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:17,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:17,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:17,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:15:17,200 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:17,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1685380437, now seen corresponding path program 1 times [2024-11-08 17:15:17,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062040783] [2024-11-08 17:15:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:17,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:17,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062040783] [2024-11-08 17:15:17,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062040783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:17,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:17,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:15:17,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179553946] [2024-11-08 17:15:17,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:17,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:15:17,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:17,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:15:17,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:15:17,353 INFO L87 Difference]: Start difference. First operand 396 states and 616 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:18,614 INFO L93 Difference]: Finished difference Result 919 states and 1453 transitions. [2024-11-08 17:15:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:15:18,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:18,617 INFO L225 Difference]: With dead ends: 919 [2024-11-08 17:15:18,618 INFO L226 Difference]: Without dead ends: 538 [2024-11-08 17:15:18,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:18,619 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1048 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:18,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 790 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:15:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-08 17:15:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 396. [2024-11-08 17:15:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.554016620498615) internal successors, (561), 363 states have internal predecessors, (561), 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-11-08 17:15:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 615 transitions. [2024-11-08 17:15:18,638 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 615 transitions. Word has length 179 [2024-11-08 17:15:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:18,639 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 615 transitions. [2024-11-08 17:15:18,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2024-11-08 17:15:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:18,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:18,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:18,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:15:18,640 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:18,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1186823635, now seen corresponding path program 1 times [2024-11-08 17:15:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091132183] [2024-11-08 17:15:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:18,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091132183] [2024-11-08 17:15:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091132183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:18,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:15:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367040679] [2024-11-08 17:15:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:18,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:15:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:15:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:15:18,859 INFO L87 Difference]: Start difference. First operand 396 states and 615 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:20,998 INFO L93 Difference]: Finished difference Result 1448 states and 2304 transitions. [2024-11-08 17:15:20,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:15:20,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:21,002 INFO L225 Difference]: With dead ends: 1448 [2024-11-08 17:15:21,002 INFO L226 Difference]: Without dead ends: 1073 [2024-11-08 17:15:21,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:21,003 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1585 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:21,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 1352 Invalid, 2385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:15:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-08 17:15:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 788. [2024-11-08 17:15:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 725 states have (on average 1.566896551724138) internal successors, (1136), 728 states have internal predecessors, (1136), 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-11-08 17:15:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1235 transitions. [2024-11-08 17:15:21,050 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1235 transitions. Word has length 179 [2024-11-08 17:15:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:21,050 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1235 transitions. [2024-11-08 17:15:21,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1235 transitions. [2024-11-08 17:15:21,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:21,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:21,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:21,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:15:21,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:21,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash -198916145, now seen corresponding path program 1 times [2024-11-08 17:15:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022718317] [2024-11-08 17:15:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:21,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:21,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022718317] [2024-11-08 17:15:21,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022718317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:21,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:21,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491039613] [2024-11-08 17:15:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:21,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:21,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:21,298 INFO L87 Difference]: Start difference. First operand 788 states and 1235 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:24,135 INFO L93 Difference]: Finished difference Result 2393 states and 3816 transitions. [2024-11-08 17:15:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:15:24,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:24,141 INFO L225 Difference]: With dead ends: 2393 [2024-11-08 17:15:24,141 INFO L226 Difference]: Without dead ends: 1626 [2024-11-08 17:15:24,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:15:24,143 INFO L432 NwaCegarLoop]: 591 mSDtfsCounter, 1616 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 3669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:24,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 2628 Invalid, 3669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 3604 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 17:15:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2024-11-08 17:15:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1153. [2024-11-08 17:15:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1062 states have (on average 1.5602636534839924) internal successors, (1657), 1066 states have internal predecessors, (1657), 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-11-08 17:15:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1800 transitions. [2024-11-08 17:15:24,190 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1800 transitions. Word has length 179 [2024-11-08 17:15:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:24,191 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1800 transitions. [2024-11-08 17:15:24,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1800 transitions. [2024-11-08 17:15:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:24,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:24,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:24,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:15:24,193 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:24,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1968387759, now seen corresponding path program 1 times [2024-11-08 17:15:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:24,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002268340] [2024-11-08 17:15:24,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:24,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:24,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:24,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:24,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:24,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002268340] [2024-11-08 17:15:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002268340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:24,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:24,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:24,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297704477] [2024-11-08 17:15:24,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:24,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:24,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:24,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:24,450 INFO L87 Difference]: Start difference. First operand 1153 states and 1800 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:27,313 INFO L93 Difference]: Finished difference Result 3787 states and 6027 transitions. [2024-11-08 17:15:27,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:15:27,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:27,321 INFO L225 Difference]: With dead ends: 3787 [2024-11-08 17:15:27,321 INFO L226 Difference]: Without dead ends: 2655 [2024-11-08 17:15:27,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:15:27,324 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1614 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3600 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:27,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 2626 Invalid, 3667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3600 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 17:15:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2024-11-08 17:15:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1884. [2024-11-08 17:15:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1737 states have (on average 1.5544041450777202) internal successors, (2700), 1743 states have internal predecessors, (2700), 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-11-08 17:15:27,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2935 transitions. [2024-11-08 17:15:27,419 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2935 transitions. Word has length 179 [2024-11-08 17:15:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:27,419 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2935 transitions. [2024-11-08 17:15:27,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2935 transitions. [2024-11-08 17:15:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:27,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:27,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:27,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:15:27,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:27,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1715310479, now seen corresponding path program 1 times [2024-11-08 17:15:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:27,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223549350] [2024-11-08 17:15:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:27,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:27,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223549350] [2024-11-08 17:15:27,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223549350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:27,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:27,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717050350] [2024-11-08 17:15:27,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:27,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:27,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:27,631 INFO L87 Difference]: Start difference. First operand 1884 states and 2935 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:28,917 INFO L93 Difference]: Finished difference Result 4506 states and 7153 transitions. [2024-11-08 17:15:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:15:28,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:28,926 INFO L225 Difference]: With dead ends: 4506 [2024-11-08 17:15:28,926 INFO L226 Difference]: Without dead ends: 2643 [2024-11-08 17:15:28,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:28,930 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1324 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:28,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 1110 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:15:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2024-11-08 17:15:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 1884. [2024-11-08 17:15:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1737 states have (on average 1.551525618883132) internal successors, (2695), 1743 states have internal predecessors, (2695), 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-11-08 17:15:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2930 transitions. [2024-11-08 17:15:29,057 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2930 transitions. Word has length 179 [2024-11-08 17:15:29,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:29,057 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2930 transitions. [2024-11-08 17:15:29,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2930 transitions. [2024-11-08 17:15:29,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:29,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:29,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:29,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:15:29,060 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:29,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash 310118801, now seen corresponding path program 1 times [2024-11-08 17:15:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:29,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197177261] [2024-11-08 17:15:29,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:29,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:29,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:29,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:29,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:29,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197177261] [2024-11-08 17:15:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197177261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:29,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:29,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989378391] [2024-11-08 17:15:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:29,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:29,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:29,265 INFO L87 Difference]: Start difference. First operand 1884 states and 2930 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:30,747 INFO L93 Difference]: Finished difference Result 4500 states and 7127 transitions. [2024-11-08 17:15:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:15:30,748 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:30,755 INFO L225 Difference]: With dead ends: 4500 [2024-11-08 17:15:30,755 INFO L226 Difference]: Without dead ends: 2637 [2024-11-08 17:15:30,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:30,758 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1160 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:30,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1322 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:15:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2024-11-08 17:15:30,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 1884. [2024-11-08 17:15:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1737 states have (on average 1.5486470926885434) internal successors, (2690), 1743 states have internal predecessors, (2690), 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-11-08 17:15:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2925 transitions. [2024-11-08 17:15:30,844 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2925 transitions. Word has length 179 [2024-11-08 17:15:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:30,845 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2925 transitions. [2024-11-08 17:15:30,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2925 transitions. [2024-11-08 17:15:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:30,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:30,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:30,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:15:30,847 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:30,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash -2090514609, now seen corresponding path program 1 times [2024-11-08 17:15:30,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:30,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133028692] [2024-11-08 17:15:30,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:31,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:31,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133028692] [2024-11-08 17:15:31,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133028692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:31,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259523821] [2024-11-08 17:15:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:31,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:31,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:31,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:31,030 INFO L87 Difference]: Start difference. First operand 1884 states and 2925 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:32,492 INFO L93 Difference]: Finished difference Result 4488 states and 7089 transitions. [2024-11-08 17:15:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:15:32,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:32,501 INFO L225 Difference]: With dead ends: 4488 [2024-11-08 17:15:32,501 INFO L226 Difference]: Without dead ends: 2625 [2024-11-08 17:15:32,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:32,505 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1235 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 1760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:32,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 1321 Invalid, 1760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:15:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2024-11-08 17:15:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 1884. [2024-11-08 17:15:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1737 states have (on average 1.545768566493955) internal successors, (2685), 1743 states have internal predecessors, (2685), 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-11-08 17:15:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2920 transitions. [2024-11-08 17:15:32,600 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2920 transitions. Word has length 179 [2024-11-08 17:15:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:32,600 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 2920 transitions. [2024-11-08 17:15:32,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2920 transitions. [2024-11-08 17:15:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:32,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:32,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:32,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:15:32,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:32,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:32,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1281285261, now seen corresponding path program 1 times [2024-11-08 17:15:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:32,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209731101] [2024-11-08 17:15:32,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:32,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:32,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:32,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:32,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:32,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:32,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:32,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209731101] [2024-11-08 17:15:32,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209731101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:32,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:32,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342856931] [2024-11-08 17:15:32,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:32,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:32,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:32,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:32,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:32,818 INFO L87 Difference]: Start difference. First operand 1884 states and 2920 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:35,594 INFO L93 Difference]: Finished difference Result 6445 states and 10138 transitions. [2024-11-08 17:15:35,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:15:35,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:35,609 INFO L225 Difference]: With dead ends: 6445 [2024-11-08 17:15:35,609 INFO L226 Difference]: Without dead ends: 4582 [2024-11-08 17:15:35,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:15:35,613 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1593 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:35,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 2626 Invalid, 3561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:15:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2024-11-08 17:15:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 3365. [2024-11-08 17:15:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3106 states have (on average 1.5405666452028333) internal successors, (4785), 3116 states have internal predecessors, (4785), 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-11-08 17:15:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 5210 transitions. [2024-11-08 17:15:35,855 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 5210 transitions. Word has length 179 [2024-11-08 17:15:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:35,855 INFO L471 AbstractCegarLoop]: Abstraction has 3365 states and 5210 transitions. [2024-11-08 17:15:35,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:35,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 5210 transitions. [2024-11-08 17:15:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:35,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:35,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:35,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:15:35,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:35,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:35,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1667147663, now seen corresponding path program 1 times [2024-11-08 17:15:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:35,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151827882] [2024-11-08 17:15:35,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:35,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:35,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:35,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:35,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:36,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:36,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151827882] [2024-11-08 17:15:36,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151827882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:36,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:36,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:36,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186598382] [2024-11-08 17:15:36,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:36,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:36,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:36,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:36,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:36,033 INFO L87 Difference]: Start difference. First operand 3365 states and 5210 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:37,303 INFO L93 Difference]: Finished difference Result 7946 states and 12496 transitions. [2024-11-08 17:15:37,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:15:37,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:37,315 INFO L225 Difference]: With dead ends: 7946 [2024-11-08 17:15:37,315 INFO L226 Difference]: Without dead ends: 4602 [2024-11-08 17:15:37,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:37,319 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1323 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:37,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 1110 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 17:15:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2024-11-08 17:15:37,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 3365. [2024-11-08 17:15:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3106 states have (on average 1.5376690276883451) internal successors, (4776), 3116 states have internal predecessors, (4776), 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-11-08 17:15:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 5201 transitions. [2024-11-08 17:15:37,481 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 5201 transitions. Word has length 179 [2024-11-08 17:15:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:37,481 INFO L471 AbstractCegarLoop]: Abstraction has 3365 states and 5201 transitions. [2024-11-08 17:15:37,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 5201 transitions. [2024-11-08 17:15:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:37,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:37,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:37,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:15:37,484 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:37,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1402500173, now seen corresponding path program 1 times [2024-11-08 17:15:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:37,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867196957] [2024-11-08 17:15:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:37,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:37,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867196957] [2024-11-08 17:15:37,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867196957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:37,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:37,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:37,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002332725] [2024-11-08 17:15:37,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:37,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:37,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:37,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:37,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:37,689 INFO L87 Difference]: Start difference. First operand 3365 states and 5201 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:40,691 INFO L93 Difference]: Finished difference Result 11802 states and 18482 transitions. [2024-11-08 17:15:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:15:40,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:40,712 INFO L225 Difference]: With dead ends: 11802 [2024-11-08 17:15:40,713 INFO L226 Difference]: Without dead ends: 8458 [2024-11-08 17:15:40,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:15:40,719 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1585 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:40,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 2626 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3456 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:15:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2024-11-08 17:15:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 6335. [2024-11-08 17:15:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5852 states have (on average 1.533151059466849) internal successors, (8972), 5870 states have internal predecessors, (8972), 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-11-08 17:15:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9795 transitions. [2024-11-08 17:15:41,064 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9795 transitions. Word has length 179 [2024-11-08 17:15:41,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:41,064 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9795 transitions. [2024-11-08 17:15:41,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9795 transitions. [2024-11-08 17:15:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:41,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:41,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:41,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:15:41,067 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash -961341489, now seen corresponding path program 1 times [2024-11-08 17:15:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:41,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944894943] [2024-11-08 17:15:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:41,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944894943] [2024-11-08 17:15:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944894943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:41,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:41,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:41,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30428678] [2024-11-08 17:15:41,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:41,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:41,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:41,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:41,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:41,246 INFO L87 Difference]: Start difference. First operand 6335 states and 9795 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:42,975 INFO L93 Difference]: Finished difference Result 14850 states and 23303 transitions. [2024-11-08 17:15:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:15:42,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:42,993 INFO L225 Difference]: With dead ends: 14850 [2024-11-08 17:15:42,993 INFO L226 Difference]: Without dead ends: 8536 [2024-11-08 17:15:43,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:43,005 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1155 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:43,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1322 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:15:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8536 states. [2024-11-08 17:15:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8536 to 6335. [2024-11-08 17:15:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5852 states have (on average 1.530246069719754) internal successors, (8955), 5870 states have internal predecessors, (8955), 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-11-08 17:15:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9778 transitions. [2024-11-08 17:15:43,364 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9778 transitions. Word has length 179 [2024-11-08 17:15:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:43,364 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9778 transitions. [2024-11-08 17:15:43,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9778 transitions. [2024-11-08 17:15:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:43,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:43,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:43,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:15:43,367 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:43,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2010446861, now seen corresponding path program 1 times [2024-11-08 17:15:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:43,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789697385] [2024-11-08 17:15:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:43,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:43,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:43,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789697385] [2024-11-08 17:15:43,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789697385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:43,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201582823] [2024-11-08 17:15:43,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:43,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:43,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:43,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:43,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:43,546 INFO L87 Difference]: Start difference. First operand 6335 states and 9778 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:45,329 INFO L93 Difference]: Finished difference Result 14832 states and 23216 transitions. [2024-11-08 17:15:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:15:45,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:45,347 INFO L225 Difference]: With dead ends: 14832 [2024-11-08 17:15:45,347 INFO L226 Difference]: Without dead ends: 8518 [2024-11-08 17:15:45,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:45,357 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1153 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:45,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 1322 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 17:15:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8518 states. [2024-11-08 17:15:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8518 to 6335. [2024-11-08 17:15:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 5852 states have (on average 1.527341079972659) internal successors, (8938), 5870 states have internal predecessors, (8938), 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-11-08 17:15:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9761 transitions. [2024-11-08 17:15:45,700 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9761 transitions. Word has length 179 [2024-11-08 17:15:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:45,700 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9761 transitions. [2024-11-08 17:15:45,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9761 transitions. [2024-11-08 17:15:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:45,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:45,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:45,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:15:45,703 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:45,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:45,703 INFO L85 PathProgramCache]: Analyzing trace with hash -387540977, now seen corresponding path program 1 times [2024-11-08 17:15:45,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653415543] [2024-11-08 17:15:45,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:45,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653415543] [2024-11-08 17:15:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653415543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:45,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:45,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:45,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004630167] [2024-11-08 17:15:45,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:45,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:45,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:45,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:45,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:45,963 INFO L87 Difference]: Start difference. First operand 6335 states and 9761 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:49,312 INFO L93 Difference]: Finished difference Result 22494 states and 35058 transitions. [2024-11-08 17:15:49,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:15:49,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:49,352 INFO L225 Difference]: With dead ends: 22494 [2024-11-08 17:15:49,352 INFO L226 Difference]: Without dead ends: 16180 [2024-11-08 17:15:49,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:15:49,365 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1576 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3388 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:49,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 2626 Invalid, 3455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3388 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:15:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16180 states. [2024-11-08 17:15:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16180 to 12322. [2024-11-08 17:15:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12322 states, 11391 states have (on average 1.523307874637872) internal successors, (17352), 11425 states have internal predecessors, (17352), 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-11-08 17:15:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12322 states to 12322 states and 19025 transitions. [2024-11-08 17:15:50,081 INFO L78 Accepts]: Start accepts. Automaton has 12322 states and 19025 transitions. Word has length 179 [2024-11-08 17:15:50,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:50,082 INFO L471 AbstractCegarLoop]: Abstraction has 12322 states and 19025 transitions. [2024-11-08 17:15:50,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand 12322 states and 19025 transitions. [2024-11-08 17:15:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:50,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:50,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:50,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:15:50,087 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:50,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash -49253427, now seen corresponding path program 1 times [2024-11-08 17:15:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:50,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835950523] [2024-11-08 17:15:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:50,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:50,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835950523] [2024-11-08 17:15:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835950523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953772957] [2024-11-08 17:15:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:50,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:50,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:50,364 INFO L87 Difference]: Start difference. First operand 12322 states and 19025 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:55,035 INFO L93 Difference]: Finished difference Result 49197 states and 76786 transitions. [2024-11-08 17:15:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:15:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:15:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:55,115 INFO L225 Difference]: With dead ends: 49197 [2024-11-08 17:15:55,115 INFO L226 Difference]: Without dead ends: 36896 [2024-11-08 17:15:55,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:15:55,143 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 1776 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 3766 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 3869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:55,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1794 Valid, 1740 Invalid, 3869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3766 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 17:15:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36896 states. [2024-11-08 17:15:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36896 to 24004. [2024-11-08 17:15:56,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24004 states, 22209 states have (on average 1.5206447836462695) internal successors, (33772), 22275 states have internal predecessors, (33772), 1340 states have call successors, (1340), 391 states have call predecessors, (1340), 454 states have return successors, (2131), 1401 states have call predecessors, (2131), 1338 states have call successors, (2131) [2024-11-08 17:15:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24004 states to 24004 states and 37243 transitions. [2024-11-08 17:15:56,880 INFO L78 Accepts]: Start accepts. Automaton has 24004 states and 37243 transitions. Word has length 179 [2024-11-08 17:15:56,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:56,880 INFO L471 AbstractCegarLoop]: Abstraction has 24004 states and 37243 transitions. [2024-11-08 17:15:56,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 24004 states and 37243 transitions. [2024-11-08 17:15:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:15:56,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:56,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:56,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:15:56,889 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash -589682933, now seen corresponding path program 1 times [2024-11-08 17:15:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:56,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023062204] [2024-11-08 17:15:56,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:56,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:56,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:15:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:15:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:15:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:15:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:57,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023062204] [2024-11-08 17:15:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023062204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:57,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:57,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488497768] [2024-11-08 17:15:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:57,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:57,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:57,078 INFO L87 Difference]: Start difference. First operand 24004 states and 37243 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:16:03,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:03,807 INFO L93 Difference]: Finished difference Result 95501 states and 149738 transitions. [2024-11-08 17:16:03,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:16:03,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:16:03,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:04,070 INFO L225 Difference]: With dead ends: 95501 [2024-11-08 17:16:04,071 INFO L226 Difference]: Without dead ends: 71518 [2024-11-08 17:16:04,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:16:04,112 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 1978 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 3341 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 3411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:04,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 2616 Invalid, 3411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3341 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 17:16:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71518 states. [2024-11-08 17:16:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71518 to 47589. [2024-11-08 17:16:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47589 states, 44098 states have (on average 1.521293482697628) internal successors, (67086), 44228 states have internal predecessors, (67086), 2588 states have call successors, (2588), 775 states have call predecessors, (2588), 902 states have return successors, (4901), 2713 states have call predecessors, (4901), 2586 states have call successors, (4901) [2024-11-08 17:16:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47589 states to 47589 states and 74575 transitions. [2024-11-08 17:16:07,558 INFO L78 Accepts]: Start accepts. Automaton has 47589 states and 74575 transitions. Word has length 179 [2024-11-08 17:16:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:07,558 INFO L471 AbstractCegarLoop]: Abstraction has 47589 states and 74575 transitions. [2024-11-08 17:16:07,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:16:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47589 states and 74575 transitions. [2024-11-08 17:16:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:16:07,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:07,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:16:07,578 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:07,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -745663475, now seen corresponding path program 1 times [2024-11-08 17:16:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951902915] [2024-11-08 17:16:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:16:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:16:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:16:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:16:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:16:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951902915] [2024-11-08 17:16:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951902915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:16:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196559908] [2024-11-08 17:16:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:07,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:16:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:07,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:16:07,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:16:07,803 INFO L87 Difference]: Start difference. First operand 47589 states and 74575 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:16:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:19,233 INFO L93 Difference]: Finished difference Result 187628 states and 296976 transitions. [2024-11-08 17:16:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:16:19,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-08 17:16:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:19,618 INFO L225 Difference]: With dead ends: 187628 [2024-11-08 17:16:19,618 INFO L226 Difference]: Without dead ends: 140060 [2024-11-08 17:16:19,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:16:19,747 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 1662 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:19,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 2616 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 17:16:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140060 states. [2024-11-08 17:16:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140060 to 94694. [2024-11-08 17:16:26,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94694 states, 87875 states have (on average 1.522344238975818) internal successors, (133776), 88133 states have internal predecessors, (133776), 5020 states have call successors, (5020), 1543 states have call predecessors, (5020), 1798 states have return successors, (11835), 5273 states have call predecessors, (11835), 5018 states have call successors, (11835) [2024-11-08 17:16:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94694 states to 94694 states and 150631 transitions. [2024-11-08 17:16:26,909 INFO L78 Accepts]: Start accepts. Automaton has 94694 states and 150631 transitions. Word has length 179 [2024-11-08 17:16:26,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:26,909 INFO L471 AbstractCegarLoop]: Abstraction has 94694 states and 150631 transitions. [2024-11-08 17:16:26,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:16:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 94694 states and 150631 transitions. [2024-11-08 17:16:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 17:16:26,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:26,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:26,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:16:26,938 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:26,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash -335053109, now seen corresponding path program 1 times [2024-11-08 17:16:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761803956] [2024-11-08 17:16:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:16:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 17:16:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 17:16:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:27,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 17:16:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:16:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761803956] [2024-11-08 17:16:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761803956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:16:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371935603] [2024-11-08 17:16:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:16:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:27,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:16:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:16:27,109 INFO L87 Difference]: Start difference. First operand 94694 states and 150631 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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)