./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:09:37,295 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:09:37,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:09:37,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:09:37,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:09:37,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:09:37,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:09:37,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:09:37,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:09:37,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:09:37,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:09:37,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:09:37,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:09:37,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:09:37,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:09:37,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:09:37,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:09:37,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:09:37,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:09:37,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:09:37,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:09:37,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:09:37,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:09:37,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:09:37,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:09:37,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:09:37,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:09:37,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:09:37,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:09:37,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:09:37,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:09:37,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:09:37,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:09:37,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:09:37,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:09:37,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:09:37,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:09:37,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:09:37,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:09:37,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:09:37,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:09:37,367 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:09:37,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:09:37,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:09:37,401 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:09:37,401 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:09:37,402 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:09:37,402 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:09:37,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:09:37,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:09:37,403 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:09:37,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:09:37,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:09:37,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:09:37,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:09:37,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:09:37,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:09:37,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:09:37,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:09:37,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:09:37,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:09:37,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:09:37,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:09:37,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:09:37,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:09:37,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:09:37,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:09:37,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:09:37,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:09:37,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:09:37,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:09:37,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:09:37,407 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:09:37,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:09:37,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:09:37,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0 [2022-11-02 21:09:37,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:09:37,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:09:37,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:09:37,747 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:09:37,748 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:09:37,749 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2022-11-02 21:09:37,850 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/data/d372918c9/3dbddf2f18f94f8aa1814c9eec228279/FLAGf9704af3b [2022-11-02 21:09:38,343 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:09:38,344 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2022-11-02 21:09:38,369 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/data/d372918c9/3dbddf2f18f94f8aa1814c9eec228279/FLAGf9704af3b [2022-11-02 21:09:38,687 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/data/d372918c9/3dbddf2f18f94f8aa1814c9eec228279 [2022-11-02 21:09:38,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:09:38,691 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:09:38,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:09:38,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:09:38,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:09:38,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:09:38" (1/1) ... [2022-11-02 21:09:38,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753697fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:38, skipping insertion in model container [2022-11-02 21:09:38,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:09:38" (1/1) ... [2022-11-02 21:09:38,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:09:38,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:09:38,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[914,927] [2022-11-02 21:09:39,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[7115,7128] [2022-11-02 21:09:39,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:09:39,212 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:09:39,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[914,927] [2022-11-02 21:09:39,251 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[7115,7128] [2022-11-02 21:09:39,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:09:39,327 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:09:39,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39 WrapperNode [2022-11-02 21:09:39,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:09:39,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:09:39,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:09:39,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:09:39,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,416 INFO L138 Inliner]: procedures = 63, calls = 72, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 634 [2022-11-02 21:09:39,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:09:39,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:09:39,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:09:39,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:09:39,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,486 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:09:39,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:09:39,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:09:39,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:09:39,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (1/1) ... [2022-11-02 21:09:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:09:39,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:39,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:09:39,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:09:39,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:09:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-02 21:09:39,569 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-02 21:09:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-02 21:09:39,569 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-02 21:09:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-02 21:09:39,569 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-02 21:09:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-02 21:09:39,570 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-02 21:09:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-02 21:09:39,570 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-02 21:09:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-02 21:09:39,570 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-02 21:09:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-02 21:09:39,570 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-02 21:09:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-02 21:09:39,571 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-02 21:09:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-02 21:09:39,571 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-02 21:09:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-02 21:09:39,571 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-02 21:09:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-02 21:09:39,572 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-02 21:09:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:09:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-02 21:09:39,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-02 21:09:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-02 21:09:39,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-02 21:09:39,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:09:39,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:09:39,573 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-02 21:09:39,573 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-02 21:09:39,678 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:09:39,681 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:09:40,661 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:09:40,676 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:09:40,680 INFO L300 CfgBuilder]: Removed 12 assume(true) statements. [2022-11-02 21:09:40,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:40 BoogieIcfgContainer [2022-11-02 21:09:40,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:09:40,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:09:40,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:09:40,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:09:40,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:09:38" (1/3) ... [2022-11-02 21:09:40,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711fc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:40, skipping insertion in model container [2022-11-02 21:09:40,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:39" (2/3) ... [2022-11-02 21:09:40,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711fc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:40, skipping insertion in model container [2022-11-02 21:09:40,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:40" (3/3) ... [2022-11-02 21:09:40,698 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2022-11-02 21:09:40,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:09:40,727 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 21:09:40,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:09:40,835 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5d8acfd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:09:40,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 21:09:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 308 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 264 states have internal predecessors, (412), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-02 21:09:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:09:40,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:40,862 INFO L195 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] [2022-11-02 21:09:40,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2128266520, now seen corresponding path program 1 times [2022-11-02 21:09:40,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:40,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379476762] [2022-11-02 21:09:40,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:40,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:41,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:41,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:41,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379476762] [2022-11-02 21:09:41,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379476762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:41,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:41,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:41,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747112891] [2022-11-02 21:09:41,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:41,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:41,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:41,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:41,366 INFO L87 Difference]: Start difference. First operand has 308 states, 258 states have (on average 1.5968992248062015) internal successors, (412), 264 states have internal predecessors, (412), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:42,296 INFO L93 Difference]: Finished difference Result 613 states and 949 transitions. [2022-11-02 21:09:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 21:09:42,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 21:09:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:42,321 INFO L225 Difference]: With dead ends: 613 [2022-11-02 21:09:42,321 INFO L226 Difference]: Without dead ends: 316 [2022-11-02 21:09:42,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:09:42,342 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 472 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:42,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1200 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:09:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-02 21:09:42,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2022-11-02 21:09:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 250 states have (on average 1.5) internal successors, (375), 254 states have internal predecessors, (375), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-11-02 21:09:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 439 transitions. [2022-11-02 21:09:42,412 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 439 transitions. Word has length 65 [2022-11-02 21:09:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:42,413 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 439 transitions. [2022-11-02 21:09:42,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 439 transitions. [2022-11-02 21:09:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:09:42,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:42,417 INFO L195 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] [2022-11-02 21:09:42,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:09:42,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash 779915366, now seen corresponding path program 1 times [2022-11-02 21:09:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:42,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213758396] [2022-11-02 21:09:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:42,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:42,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:42,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:42,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213758396] [2022-11-02 21:09:42,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213758396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:42,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:42,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:09:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659135693] [2022-11-02 21:09:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:42,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:09:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:09:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:09:42,735 INFO L87 Difference]: Start difference. First operand 298 states and 439 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:43,779 INFO L93 Difference]: Finished difference Result 521 states and 753 transitions. [2022-11-02 21:09:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:09:43,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 21:09:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:43,787 INFO L225 Difference]: With dead ends: 521 [2022-11-02 21:09:43,787 INFO L226 Difference]: Without dead ends: 433 [2022-11-02 21:09:43,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:09:43,793 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 561 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:43,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1634 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:09:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-02 21:09:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 394. [2022-11-02 21:09:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 326 states have (on average 1.469325153374233) internal successors, (479), 332 states have internal predecessors, (479), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2022-11-02 21:09:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 570 transitions. [2022-11-02 21:09:43,876 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 570 transitions. Word has length 65 [2022-11-02 21:09:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:43,876 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 570 transitions. [2022-11-02 21:09:43,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:43,877 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 570 transitions. [2022-11-02 21:09:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:09:43,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:43,889 INFO L195 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] [2022-11-02 21:09:43,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:09:43,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1836163290, now seen corresponding path program 1 times [2022-11-02 21:09:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:43,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801322529] [2022-11-02 21:09:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:44,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801322529] [2022-11-02 21:09:44,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801322529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:44,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:44,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:09:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373913017] [2022-11-02 21:09:44,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:44,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:09:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:44,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:09:44,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:09:44,189 INFO L87 Difference]: Start difference. First operand 394 states and 570 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:45,340 INFO L93 Difference]: Finished difference Result 741 states and 1046 transitions. [2022-11-02 21:09:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:09:45,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 21:09:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:45,345 INFO L225 Difference]: With dead ends: 741 [2022-11-02 21:09:45,345 INFO L226 Difference]: Without dead ends: 564 [2022-11-02 21:09:45,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:09:45,347 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 839 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:45,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1748 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:09:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-02 21:09:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 490. [2022-11-02 21:09:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 402 states have (on average 1.4477611940298507) internal successors, (582), 410 states have internal predecessors, (582), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-02 21:09:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2022-11-02 21:09:45,419 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 65 [2022-11-02 21:09:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:45,420 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2022-11-02 21:09:45,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2022-11-02 21:09:45,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:09:45,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:45,424 INFO L195 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] [2022-11-02 21:09:45,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:09:45,425 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:45,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:45,426 INFO L85 PathProgramCache]: Analyzing trace with hash 430217896, now seen corresponding path program 1 times [2022-11-02 21:09:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:45,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571880088] [2022-11-02 21:09:45,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:45,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:45,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:45,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:45,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:45,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571880088] [2022-11-02 21:09:45,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571880088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:45,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:45,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:09:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525779791] [2022-11-02 21:09:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:45,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:09:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:09:45,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:09:45,641 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:46,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:46,636 INFO L93 Difference]: Finished difference Result 791 states and 1117 transitions. [2022-11-02 21:09:46,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:09:46,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-02 21:09:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:46,644 INFO L225 Difference]: With dead ends: 791 [2022-11-02 21:09:46,646 INFO L226 Difference]: Without dead ends: 524 [2022-11-02 21:09:46,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:09:46,652 INFO L413 NwaCegarLoop]: 427 mSDtfsCounter, 548 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:46,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1709 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:09:46,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-02 21:09:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 495. [2022-11-02 21:09:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 406 states have (on average 1.438423645320197) internal successors, (584), 414 states have internal predecessors, (584), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2022-11-02 21:09:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 706 transitions. [2022-11-02 21:09:46,705 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 706 transitions. Word has length 65 [2022-11-02 21:09:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:46,705 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 706 transitions. [2022-11-02 21:09:46,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 706 transitions. [2022-11-02 21:09:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:09:46,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:46,708 INFO L195 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] [2022-11-02 21:09:46,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:09:46,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash -599141402, now seen corresponding path program 1 times [2022-11-02 21:09:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:46,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464433570] [2022-11-02 21:09:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:46,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:46,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464433570] [2022-11-02 21:09:46,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464433570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:46,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:46,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:09:46,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878791584] [2022-11-02 21:09:46,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:46,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:09:46,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:46,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:09:46,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:09:46,870 INFO L87 Difference]: Start difference. First operand 495 states and 706 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:47,893 INFO L93 Difference]: Finished difference Result 813 states and 1139 transitions. [2022-11-02 21:09:47,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:09:47,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-02 21:09:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:47,898 INFO L225 Difference]: With dead ends: 813 [2022-11-02 21:09:47,898 INFO L226 Difference]: Without dead ends: 541 [2022-11-02 21:09:47,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:09:47,900 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 370 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:47,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1899 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:09:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-11-02 21:09:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 510. [2022-11-02 21:09:47,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 418 states have (on average 1.4258373205741626) internal successors, (596), 426 states have internal predecessors, (596), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2022-11-02 21:09:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 721 transitions. [2022-11-02 21:09:47,945 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 721 transitions. Word has length 65 [2022-11-02 21:09:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:47,945 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 721 transitions. [2022-11-02 21:09:47,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 721 transitions. [2022-11-02 21:09:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:09:47,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:47,947 INFO L195 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] [2022-11-02 21:09:47,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:09:47,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash 787061992, now seen corresponding path program 1 times [2022-11-02 21:09:47,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:47,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91169339] [2022-11-02 21:09:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:47,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:48,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91169339] [2022-11-02 21:09:48,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91169339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:48,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:48,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:09:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301361192] [2022-11-02 21:09:48,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:48,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:09:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:48,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:09:48,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:09:48,113 INFO L87 Difference]: Start difference. First operand 510 states and 721 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:49,206 INFO L93 Difference]: Finished difference Result 902 states and 1232 transitions. [2022-11-02 21:09:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 21:09:49,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 21:09:49,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:49,210 INFO L225 Difference]: With dead ends: 902 [2022-11-02 21:09:49,210 INFO L226 Difference]: Without dead ends: 617 [2022-11-02 21:09:49,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-02 21:09:49,212 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 1071 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:49,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1315 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:09:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-11-02 21:09:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 522. [2022-11-02 21:09:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 428 states have (on average 1.4158878504672898) internal successors, (606), 436 states have internal predecessors, (606), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2022-11-02 21:09:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 731 transitions. [2022-11-02 21:09:49,253 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 731 transitions. Word has length 65 [2022-11-02 21:09:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:49,254 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 731 transitions. [2022-11-02 21:09:49,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 731 transitions. [2022-11-02 21:09:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 21:09:49,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:49,256 INFO L195 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] [2022-11-02 21:09:49,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:09:49,256 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:49,257 INFO L85 PathProgramCache]: Analyzing trace with hash 653048486, now seen corresponding path program 1 times [2022-11-02 21:09:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:49,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823451857] [2022-11-02 21:09:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:49,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823451857] [2022-11-02 21:09:49,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823451857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:49,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:49,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:09:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139899847] [2022-11-02 21:09:49,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:49,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:09:49,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:49,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:09:49,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:09:49,400 INFO L87 Difference]: Start difference. First operand 522 states and 731 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:49,969 INFO L93 Difference]: Finished difference Result 1164 states and 1575 transitions. [2022-11-02 21:09:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:09:49,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 21:09:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:49,974 INFO L225 Difference]: With dead ends: 1164 [2022-11-02 21:09:49,974 INFO L226 Difference]: Without dead ends: 868 [2022-11-02 21:09:49,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:09:49,976 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 839 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:49,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1231 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:09:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-11-02 21:09:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 812. [2022-11-02 21:09:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 652 states have (on average 1.3650306748466257) internal successors, (890), 667 states have internal predecessors, (890), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2022-11-02 21:09:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1107 transitions. [2022-11-02 21:09:50,035 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1107 transitions. Word has length 65 [2022-11-02 21:09:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:50,036 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1107 transitions. [2022-11-02 21:09:50,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 21:09:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1107 transitions. [2022-11-02 21:09:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:09:50,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:50,039 INFO L195 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] [2022-11-02 21:09:50,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:09:50,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:50,040 INFO L85 PathProgramCache]: Analyzing trace with hash -547287697, now seen corresponding path program 1 times [2022-11-02 21:09:50,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:50,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582787420] [2022-11-02 21:09:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:50,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:50,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582787420] [2022-11-02 21:09:50,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582787420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:50,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:50,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:50,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446684890] [2022-11-02 21:09:50,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:50,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:50,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:50,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:50,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:50,118 INFO L87 Difference]: Start difference. First operand 812 states and 1107 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:50,782 INFO L93 Difference]: Finished difference Result 2015 states and 2674 transitions. [2022-11-02 21:09:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:09:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-02 21:09:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:50,790 INFO L225 Difference]: With dead ends: 2015 [2022-11-02 21:09:50,790 INFO L226 Difference]: Without dead ends: 1408 [2022-11-02 21:09:50,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:09:50,793 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 769 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:50,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1004 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 21:09:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-11-02 21:09:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1293. [2022-11-02 21:09:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1031 states have (on average 1.3317167798254121) internal successors, (1373), 1049 states have internal predecessors, (1373), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2022-11-02 21:09:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1707 transitions. [2022-11-02 21:09:50,911 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1707 transitions. Word has length 66 [2022-11-02 21:09:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:50,912 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1707 transitions. [2022-11-02 21:09:50,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1707 transitions. [2022-11-02 21:09:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 21:09:50,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:50,915 INFO L195 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] [2022-11-02 21:09:50,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:09:50,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:50,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash 910951962, now seen corresponding path program 1 times [2022-11-02 21:09:50,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:50,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325968776] [2022-11-02 21:09:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:51,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325968776] [2022-11-02 21:09:51,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325968776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:51,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:51,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259376142] [2022-11-02 21:09:51,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:51,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:51,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:51,024 INFO L87 Difference]: Start difference. First operand 1293 states and 1707 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:51,581 INFO L93 Difference]: Finished difference Result 3481 states and 4513 transitions. [2022-11-02 21:09:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:09:51,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-02 21:09:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:51,593 INFO L225 Difference]: With dead ends: 3481 [2022-11-02 21:09:51,593 INFO L226 Difference]: Without dead ends: 2413 [2022-11-02 21:09:51,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:09:51,599 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 1057 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:51,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 854 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:09:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2022-11-02 21:09:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2155. [2022-11-02 21:09:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1697 states have (on average 1.296405421331762) internal successors, (2200), 1725 states have internal predecessors, (2200), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2022-11-02 21:09:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2768 transitions. [2022-11-02 21:09:51,754 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2768 transitions. Word has length 66 [2022-11-02 21:09:51,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:51,755 INFO L495 AbstractCegarLoop]: Abstraction has 2155 states and 2768 transitions. [2022-11-02 21:09:51,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:51,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2768 transitions. [2022-11-02 21:09:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 21:09:51,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:51,759 INFO L195 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] [2022-11-02 21:09:51,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:09:51,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash 680194510, now seen corresponding path program 1 times [2022-11-02 21:09:51,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:51,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777067617] [2022-11-02 21:09:51,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:51,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:51,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777067617] [2022-11-02 21:09:51,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777067617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:51,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:51,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775092367] [2022-11-02 21:09:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:51,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:51,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:51,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:51,841 INFO L87 Difference]: Start difference. First operand 2155 states and 2768 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:52,460 INFO L93 Difference]: Finished difference Result 5065 states and 6418 transitions. [2022-11-02 21:09:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:09:52,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-11-02 21:09:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:52,477 INFO L225 Difference]: With dead ends: 5065 [2022-11-02 21:09:52,477 INFO L226 Difference]: Without dead ends: 3135 [2022-11-02 21:09:52,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:09:52,484 INFO L413 NwaCegarLoop]: 443 mSDtfsCounter, 825 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:52,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1091 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:09:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2022-11-02 21:09:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 2887. [2022-11-02 21:09:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2265 states have (on average 1.2821192052980133) internal successors, (2904), 2301 states have internal predecessors, (2904), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2022-11-02 21:09:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 3661 transitions. [2022-11-02 21:09:52,742 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 3661 transitions. Word has length 72 [2022-11-02 21:09:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:52,743 INFO L495 AbstractCegarLoop]: Abstraction has 2887 states and 3661 transitions. [2022-11-02 21:09:52,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 21:09:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3661 transitions. [2022-11-02 21:09:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-02 21:09:52,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:52,746 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:52,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:09:52,747 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash -905222844, now seen corresponding path program 1 times [2022-11-02 21:09:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:52,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693914223] [2022-11-02 21:09:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:52,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:52,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693914223] [2022-11-02 21:09:52,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693914223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:52,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:52,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:09:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389620442] [2022-11-02 21:09:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:52,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:09:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:52,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:09:52,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:09:52,881 INFO L87 Difference]: Start difference. First operand 2887 states and 3661 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-02 21:09:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:53,642 INFO L93 Difference]: Finished difference Result 3661 states and 4592 transitions. [2022-11-02 21:09:53,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:09:53,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-11-02 21:09:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:53,662 INFO L225 Difference]: With dead ends: 3661 [2022-11-02 21:09:53,662 INFO L226 Difference]: Without dead ends: 3658 [2022-11-02 21:09:53,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:09:53,665 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 1263 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:53,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 1067 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 21:09:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2022-11-02 21:09:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3381. [2022-11-02 21:09:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 2650 states have (on average 1.2739622641509434) internal successors, (3376), 2691 states have internal predecessors, (3376), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2022-11-02 21:09:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4262 transitions. [2022-11-02 21:09:53,963 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4262 transitions. Word has length 73 [2022-11-02 21:09:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:53,963 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4262 transitions. [2022-11-02 21:09:53,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-02 21:09:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4262 transitions. [2022-11-02 21:09:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-02 21:09:53,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:53,966 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:53,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:09:53,967 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2001942744, now seen corresponding path program 1 times [2022-11-02 21:09:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:53,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065534761] [2022-11-02 21:09:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:54,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065534761] [2022-11-02 21:09:54,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065534761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:54,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055413683] [2022-11-02 21:09:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:54,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:54,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:54,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:54,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:09:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:54,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 21:09:54,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:54,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:54,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055413683] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:09:54,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:09:54,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-11-02 21:09:54,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563594073] [2022-11-02 21:09:54,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:09:54,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:09:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:09:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:09:54,991 INFO L87 Difference]: Start difference. First operand 3381 states and 4262 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-02 21:09:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:57,396 INFO L93 Difference]: Finished difference Result 7822 states and 9748 transitions. [2022-11-02 21:09:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 21:09:57,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-11-02 21:09:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:57,436 INFO L225 Difference]: With dead ends: 7822 [2022-11-02 21:09:57,436 INFO L226 Difference]: Without dead ends: 7819 [2022-11-02 21:09:57,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-11-02 21:09:57,441 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 1633 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1698 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:57,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1698 Valid, 1716 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 21:09:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2022-11-02 21:09:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 5171. [2022-11-02 21:09:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 4054 states have (on average 1.27084361124815) internal successors, (5152), 4117 states have internal predecessors, (5152), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2022-11-02 21:09:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 6500 transitions. [2022-11-02 21:09:58,031 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 6500 transitions. Word has length 74 [2022-11-02 21:09:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:58,031 INFO L495 AbstractCegarLoop]: Abstraction has 5171 states and 6500 transitions. [2022-11-02 21:09:58,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-02 21:09:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 6500 transitions. [2022-11-02 21:09:58,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 21:09:58,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:58,035 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:58,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:09:58,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cda044b8-20e1-4990-8592-3968f5c45039/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 21:09:58,252 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:58,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:58,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1151605564, now seen corresponding path program 2 times [2022-11-02 21:09:58,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:58,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260582358] [2022-11-02 21:09:58,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:58,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:58,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:58,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:58,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260582358] [2022-11-02 21:09:58,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260582358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:58,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:58,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:58,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499230461] [2022-11-02 21:09:58,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:58,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:58,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:58,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:58,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:58,343 INFO L87 Difference]: Start difference. First operand 5171 states and 6500 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-02 21:09:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:59,143 INFO L93 Difference]: Finished difference Result 7853 states and 9873 transitions. [2022-11-02 21:09:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:09:59,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-11-02 21:09:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:59,160 INFO L225 Difference]: With dead ends: 7853 [2022-11-02 21:09:59,160 INFO L226 Difference]: Without dead ends: 3778 [2022-11-02 21:09:59,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:09:59,170 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 926 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:59,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 974 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 21:09:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2022-11-02 21:09:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3543. [2022-11-02 21:09:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 2782 states have (on average 1.2552120776419842) internal successors, (3492), 2823 states have internal predecessors, (3492), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2022-11-02 21:09:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 4398 transitions. [2022-11-02 21:09:59,610 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 4398 transitions. Word has length 77 [2022-11-02 21:09:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:59,610 INFO L495 AbstractCegarLoop]: Abstraction has 3543 states and 4398 transitions. [2022-11-02 21:09:59,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-02 21:09:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 4398 transitions. [2022-11-02 21:09:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-02 21:09:59,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:59,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:59,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:09:59,615 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash -948888726, now seen corresponding path program 1 times [2022-11-02 21:09:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:59,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548309271] [2022-11-02 21:09:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:09:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:09:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:09:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:09:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:09:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:09:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 21:09:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:09:59,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:59,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548309271] [2022-11-02 21:09:59,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548309271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:59,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:59,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:09:59,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737150482] [2022-11-02 21:09:59,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:59,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:09:59,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:59,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:09:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:09:59,771 INFO L87 Difference]: Start difference. First operand 3543 states and 4398 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 21:10:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:01,655 INFO L93 Difference]: Finished difference Result 10399 states and 12779 transitions. [2022-11-02 21:10:01,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 21:10:01,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-11-02 21:10:01,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:01,679 INFO L225 Difference]: With dead ends: 10399 [2022-11-02 21:10:01,679 INFO L226 Difference]: Without dead ends: 5778 [2022-11-02 21:10:01,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-11-02 21:10:01,689 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 774 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:01,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1571 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 21:10:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2022-11-02 21:10:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5458. [2022-11-02 21:10:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5458 states, 4240 states have (on average 1.2308962264150944) internal successors, (5219), 4324 states have internal predecessors, (5219), 584 states have call successors, (584), 481 states have call predecessors, (584), 632 states have return successors, (908), 659 states have call predecessors, (908), 583 states have call successors, (908) [2022-11-02 21:10:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5458 states to 5458 states and 6711 transitions. [2022-11-02 21:10:02,290 INFO L78 Accepts]: Start accepts. Automaton has 5458 states and 6711 transitions. Word has length 84 [2022-11-02 21:10:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:02,291 INFO L495 AbstractCegarLoop]: Abstraction has 5458 states and 6711 transitions. [2022-11-02 21:10:02,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 21:10:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5458 states and 6711 transitions. [2022-11-02 21:10:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 21:10:02,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:02,296 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:02,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:10:02,297 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1201115614, now seen corresponding path program 1 times [2022-11-02 21:10:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:02,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117405856] [2022-11-02 21:10:02,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:10:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:10:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:10:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:10:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 21:10:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:10:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:10:02,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:02,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117405856] [2022-11-02 21:10:02,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117405856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:02,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:02,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:10:02,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658585713] [2022-11-02 21:10:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:02,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:10:02,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:02,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:10:02,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:10:02,505 INFO L87 Difference]: Start difference. First operand 5458 states and 6711 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 21:10:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:04,388 INFO L93 Difference]: Finished difference Result 9461 states and 11551 transitions. [2022-11-02 21:10:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 21:10:04,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-11-02 21:10:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:04,422 INFO L225 Difference]: With dead ends: 9461 [2022-11-02 21:10:04,423 INFO L226 Difference]: Without dead ends: 4868 [2022-11-02 21:10:04,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-11-02 21:10:04,438 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 1709 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:04,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1395 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 21:10:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2022-11-02 21:10:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4534. [2022-11-02 21:10:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4534 states, 3529 states have (on average 1.2235760838764522) internal successors, (4318), 3595 states have internal predecessors, (4318), 485 states have call successors, (485), 396 states have call predecessors, (485), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2022-11-02 21:10:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5489 transitions. [2022-11-02 21:10:05,007 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5489 transitions. Word has length 93 [2022-11-02 21:10:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:05,007 INFO L495 AbstractCegarLoop]: Abstraction has 4534 states and 5489 transitions. [2022-11-02 21:10:05,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 21:10:05,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5489 transitions. [2022-11-02 21:10:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:05,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:05,012 INFO L195 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] [2022-11-02 21:10:05,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:10:05,012 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:05,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:05,013 INFO L85 PathProgramCache]: Analyzing trace with hash 198003052, now seen corresponding path program 1 times [2022-11-02 21:10:05,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:05,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397252912] [2022-11-02 21:10:05,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:05,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:05,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:05,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:05,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:05,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397252912] [2022-11-02 21:10:05,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397252912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:05,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:05,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:10:05,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444350274] [2022-11-02 21:10:05,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:05,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:10:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:10:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:10:05,128 INFO L87 Difference]: Start difference. First operand 4534 states and 5489 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:06,615 INFO L93 Difference]: Finished difference Result 4791 states and 5893 transitions. [2022-11-02 21:10:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:10:06,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:06,631 INFO L225 Difference]: With dead ends: 4791 [2022-11-02 21:10:06,632 INFO L226 Difference]: Without dead ends: 4599 [2022-11-02 21:10:06,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:10:06,635 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 605 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:06,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 836 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:10:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2022-11-02 21:10:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 4534. [2022-11-02 21:10:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4534 states, 3529 states have (on average 1.2232927174837065) internal successors, (4317), 3595 states have internal predecessors, (4317), 485 states have call successors, (485), 396 states have call predecessors, (485), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2022-11-02 21:10:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5488 transitions. [2022-11-02 21:10:07,300 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5488 transitions. Word has length 101 [2022-11-02 21:10:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:07,301 INFO L495 AbstractCegarLoop]: Abstraction has 4534 states and 5488 transitions. [2022-11-02 21:10:07,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5488 transitions. [2022-11-02 21:10:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:07,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:07,327 INFO L195 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] [2022-11-02 21:10:07,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:10:07,328 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:07,329 INFO L85 PathProgramCache]: Analyzing trace with hash 968736618, now seen corresponding path program 1 times [2022-11-02 21:10:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:07,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441979324] [2022-11-02 21:10:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:07,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:07,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:07,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:07,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441979324] [2022-11-02 21:10:07,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441979324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:07,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:07,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:10:07,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265311853] [2022-11-02 21:10:07,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:07,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:10:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:10:07,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:10:07,473 INFO L87 Difference]: Start difference. First operand 4534 states and 5488 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:09,790 INFO L93 Difference]: Finished difference Result 5046 states and 6295 transitions. [2022-11-02 21:10:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:10:09,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:09,806 INFO L225 Difference]: With dead ends: 5046 [2022-11-02 21:10:09,806 INFO L226 Difference]: Without dead ends: 4857 [2022-11-02 21:10:09,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:10:09,811 INFO L413 NwaCegarLoop]: 473 mSDtfsCounter, 967 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:09,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1135 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 21:10:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2022-11-02 21:10:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 4728. [2022-11-02 21:10:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4728 states, 3702 states have (on average 1.2387898433279307) internal successors, (4586), 3769 states have internal predecessors, (4586), 499 states have call successors, (499), 402 states have call predecessors, (499), 525 states have return successors, (703), 563 states have call predecessors, (703), 498 states have call successors, (703) [2022-11-02 21:10:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 5788 transitions. [2022-11-02 21:10:10,395 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 5788 transitions. Word has length 101 [2022-11-02 21:10:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:10,396 INFO L495 AbstractCegarLoop]: Abstraction has 4728 states and 5788 transitions. [2022-11-02 21:10:10,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 5788 transitions. [2022-11-02 21:10:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:10,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:10,401 INFO L195 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] [2022-11-02 21:10:10,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:10:10,401 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:10,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1449747860, now seen corresponding path program 1 times [2022-11-02 21:10:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:10,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275002656] [2022-11-02 21:10:10,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:10,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:10,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:10,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:10,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:10,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:10,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275002656] [2022-11-02 21:10:10,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275002656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:10,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:10,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:10:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764736850] [2022-11-02 21:10:10,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:10,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:10,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:10,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:10,554 INFO L87 Difference]: Start difference. First operand 4728 states and 5788 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:13,149 INFO L93 Difference]: Finished difference Result 5506 states and 7012 transitions. [2022-11-02 21:10:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:10:13,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:13,166 INFO L225 Difference]: With dead ends: 5506 [2022-11-02 21:10:13,166 INFO L226 Difference]: Without dead ends: 5123 [2022-11-02 21:10:13,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:10:13,172 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 972 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:13,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1804 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 21:10:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5123 states. [2022-11-02 21:10:13,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5123 to 4910. [2022-11-02 21:10:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4910 states, 3863 states have (on average 1.250582448873932) internal successors, (4831), 3931 states have internal predecessors, (4831), 513 states have call successors, (513), 408 states have call predecessors, (513), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2022-11-02 21:10:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 6063 transitions. [2022-11-02 21:10:13,912 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 6063 transitions. Word has length 101 [2022-11-02 21:10:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:13,912 INFO L495 AbstractCegarLoop]: Abstraction has 4910 states and 6063 transitions. [2022-11-02 21:10:13,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 6063 transitions. [2022-11-02 21:10:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:13,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:13,918 INFO L195 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] [2022-11-02 21:10:13,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:10:13,918 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash -124891666, now seen corresponding path program 1 times [2022-11-02 21:10:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:13,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274825157] [2022-11-02 21:10:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:14,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:14,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274825157] [2022-11-02 21:10:14,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274825157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:14,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:14,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:10:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558497790] [2022-11-02 21:10:14,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:14,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:14,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:14,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:14,067 INFO L87 Difference]: Start difference. First operand 4910 states and 6063 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:16,881 INFO L93 Difference]: Finished difference Result 6181 states and 8055 transitions. [2022-11-02 21:10:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:10:16,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:16,898 INFO L225 Difference]: With dead ends: 6181 [2022-11-02 21:10:16,899 INFO L226 Difference]: Without dead ends: 5616 [2022-11-02 21:10:16,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:10:16,904 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 968 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:16,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1797 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 21:10:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5616 states. [2022-11-02 21:10:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5616 to 5277. [2022-11-02 21:10:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5277 states, 4188 states have (on average 1.2717287488061126) internal successors, (5326), 4258 states have internal predecessors, (5326), 541 states have call successors, (541), 420 states have call predecessors, (541), 546 states have return successors, (755), 608 states have call predecessors, (755), 540 states have call successors, (755) [2022-11-02 21:10:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 6622 transitions. [2022-11-02 21:10:17,558 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 6622 transitions. Word has length 101 [2022-11-02 21:10:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:17,559 INFO L495 AbstractCegarLoop]: Abstraction has 5277 states and 6622 transitions. [2022-11-02 21:10:17,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 6622 transitions. [2022-11-02 21:10:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:17,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:17,565 INFO L195 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] [2022-11-02 21:10:17,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:10:17,565 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:17,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1441866284, now seen corresponding path program 1 times [2022-11-02 21:10:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:17,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311636475] [2022-11-02 21:10:17,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:17,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:17,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:17,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:17,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:17,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311636475] [2022-11-02 21:10:17,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311636475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:17,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:17,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:10:17,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002051281] [2022-11-02 21:10:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:17,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:17,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:17,718 INFO L87 Difference]: Start difference. First operand 5277 states and 6622 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:20,452 INFO L93 Difference]: Finished difference Result 7490 states and 10074 transitions. [2022-11-02 21:10:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:10:20,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:20,473 INFO L225 Difference]: With dead ends: 7490 [2022-11-02 21:10:20,473 INFO L226 Difference]: Without dead ends: 6558 [2022-11-02 21:10:20,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:10:20,480 INFO L413 NwaCegarLoop]: 604 mSDtfsCounter, 967 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:20,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1792 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 21:10:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2022-11-02 21:10:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6014. [2022-11-02 21:10:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6014 states, 4841 states have (on average 1.305515389382359) internal successors, (6320), 4915 states have internal predecessors, (6320), 597 states have call successors, (597), 444 states have call predecessors, (597), 574 states have return successors, (833), 668 states have call predecessors, (833), 596 states have call successors, (833) [2022-11-02 21:10:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6014 states to 6014 states and 7750 transitions. [2022-11-02 21:10:21,305 INFO L78 Accepts]: Start accepts. Automaton has 6014 states and 7750 transitions. Word has length 101 [2022-11-02 21:10:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:21,305 INFO L495 AbstractCegarLoop]: Abstraction has 6014 states and 7750 transitions. [2022-11-02 21:10:21,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6014 states and 7750 transitions. [2022-11-02 21:10:21,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:21,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:21,311 INFO L195 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] [2022-11-02 21:10:21,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:10:21,312 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash 384028206, now seen corresponding path program 1 times [2022-11-02 21:10:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:21,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797694582] [2022-11-02 21:10:21,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:21,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:21,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:21,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:21,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:21,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:21,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:21,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797694582] [2022-11-02 21:10:21,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797694582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:21,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:21,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:10:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337504934] [2022-11-02 21:10:21,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:21,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:21,461 INFO L87 Difference]: Start difference. First operand 6014 states and 7750 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:24,520 INFO L93 Difference]: Finished difference Result 10109 states and 14132 transitions. [2022-11-02 21:10:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:10:24,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:24,548 INFO L225 Difference]: With dead ends: 10109 [2022-11-02 21:10:24,549 INFO L226 Difference]: Without dead ends: 8440 [2022-11-02 21:10:24,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:10:24,559 INFO L413 NwaCegarLoop]: 599 mSDtfsCounter, 966 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:24,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 1787 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 21:10:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8440 states. [2022-11-02 21:10:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8440 to 7495. [2022-11-02 21:10:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7495 states, 6154 states have (on average 1.3516412089697758) internal successors, (8318), 6236 states have internal predecessors, (8318), 709 states have call successors, (709), 492 states have call predecessors, (709), 630 states have return successors, (1007), 788 states have call predecessors, (1007), 708 states have call successors, (1007) [2022-11-02 21:10:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7495 states to 7495 states and 10034 transitions. [2022-11-02 21:10:25,374 INFO L78 Accepts]: Start accepts. Automaton has 7495 states and 10034 transitions. Word has length 101 [2022-11-02 21:10:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:25,375 INFO L495 AbstractCegarLoop]: Abstraction has 7495 states and 10034 transitions. [2022-11-02 21:10:25,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 7495 states and 10034 transitions. [2022-11-02 21:10:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:25,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:25,381 INFO L195 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] [2022-11-02 21:10:25,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:10:25,381 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash -758474260, now seen corresponding path program 1 times [2022-11-02 21:10:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:25,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927282910] [2022-11-02 21:10:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:25,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:25,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:25,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:25,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927282910] [2022-11-02 21:10:25,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927282910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:25,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:25,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:10:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409072535] [2022-11-02 21:10:25,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:25,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:25,526 INFO L87 Difference]: Start difference. First operand 7495 states and 10034 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:29,198 INFO L93 Difference]: Finished difference Result 16612 states and 24200 transitions. [2022-11-02 21:10:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:10:29,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:29,249 INFO L225 Difference]: With dead ends: 16612 [2022-11-02 21:10:29,249 INFO L226 Difference]: Without dead ends: 13462 [2022-11-02 21:10:29,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:10:29,264 INFO L413 NwaCegarLoop]: 680 mSDtfsCounter, 1018 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:29,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1860 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 21:10:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13462 states. [2022-11-02 21:10:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13462 to 10424. [2022-11-02 21:10:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10424 states, 8763 states have (on average 1.4040853588953555) internal successors, (12304), 8861 states have internal predecessors, (12304), 917 states have call successors, (917), 588 states have call predecessors, (917), 742 states have return successors, (1393), 1012 states have call predecessors, (1393), 916 states have call successors, (1393) [2022-11-02 21:10:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10424 states to 10424 states and 14614 transitions. [2022-11-02 21:10:30,841 INFO L78 Accepts]: Start accepts. Automaton has 10424 states and 14614 transitions. Word has length 101 [2022-11-02 21:10:30,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:30,842 INFO L495 AbstractCegarLoop]: Abstraction has 10424 states and 14614 transitions. [2022-11-02 21:10:30,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 10424 states and 14614 transitions. [2022-11-02 21:10:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:30,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:30,853 INFO L195 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] [2022-11-02 21:10:30,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:10:30,853 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:30,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash -518234514, now seen corresponding path program 1 times [2022-11-02 21:10:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:30,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416195279] [2022-11-02 21:10:30,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:30,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:30,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:31,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416195279] [2022-11-02 21:10:31,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416195279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:31,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:31,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:10:31,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715696787] [2022-11-02 21:10:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:31,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:31,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:31,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:31,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:31,023 INFO L87 Difference]: Start difference. First operand 10424 states and 14614 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:35,522 INFO L93 Difference]: Finished difference Result 27827 states and 41838 transitions. [2022-11-02 21:10:35,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:10:35,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:35,598 INFO L225 Difference]: With dead ends: 27827 [2022-11-02 21:10:35,598 INFO L226 Difference]: Without dead ends: 21748 [2022-11-02 21:10:35,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:10:35,625 INFO L413 NwaCegarLoop]: 586 mSDtfsCounter, 1137 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:35,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 1763 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 21:10:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21748 states. [2022-11-02 21:10:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21748 to 16105. [2022-11-02 21:10:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16105 states, 13820 states have (on average 1.4496382054992765) internal successors, (20034), 13950 states have internal predecessors, (20034), 1317 states have call successors, (1317), 780 states have call predecessors, (1317), 966 states have return successors, (2311), 1444 states have call predecessors, (2311), 1316 states have call successors, (2311) [2022-11-02 21:10:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16105 states to 16105 states and 23662 transitions. [2022-11-02 21:10:37,908 INFO L78 Accepts]: Start accepts. Automaton has 16105 states and 23662 transitions. Word has length 101 [2022-11-02 21:10:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:37,908 INFO L495 AbstractCegarLoop]: Abstraction has 16105 states and 23662 transitions. [2022-11-02 21:10:37,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 16105 states and 23662 transitions. [2022-11-02 21:10:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:37,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:37,923 INFO L195 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] [2022-11-02 21:10:37,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:10:37,924 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:37,924 INFO L85 PathProgramCache]: Analyzing trace with hash 320799148, now seen corresponding path program 1 times [2022-11-02 21:10:37,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:37,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227358632] [2022-11-02 21:10:37,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:37,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:38,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227358632] [2022-11-02 21:10:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227358632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:38,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:38,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:10:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709123874] [2022-11-02 21:10:38,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:38,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:38,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:38,100 INFO L87 Difference]: Start difference. First operand 16105 states and 23662 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:44,831 INFO L93 Difference]: Finished difference Result 49186 states and 76020 transitions. [2022-11-02 21:10:44,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:10:44,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:10:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:44,973 INFO L225 Difference]: With dead ends: 49186 [2022-11-02 21:10:44,973 INFO L226 Difference]: Without dead ends: 37426 [2022-11-02 21:10:45,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:10:45,016 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 1038 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:45,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1376 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 21:10:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37426 states. [2022-11-02 21:10:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37426 to 27594. [2022-11-02 21:10:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27594 states, 24093 states have (on average 1.4850786535508238) internal successors, (35780), 24287 states have internal predecessors, (35780), 2085 states have call successors, (2085), 1164 states have call predecessors, (2085), 1414 states have return successors, (4601), 2276 states have call predecessors, (4601), 2084 states have call successors, (4601) [2022-11-02 21:10:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27594 states to 27594 states and 42466 transitions. [2022-11-02 21:10:48,901 INFO L78 Accepts]: Start accepts. Automaton has 27594 states and 42466 transitions. Word has length 101 [2022-11-02 21:10:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:48,901 INFO L495 AbstractCegarLoop]: Abstraction has 27594 states and 42466 transitions. [2022-11-02 21:10:48,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:10:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 27594 states and 42466 transitions. [2022-11-02 21:10:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:10:48,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:48,913 INFO L195 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] [2022-11-02 21:10:48,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:10:48,914 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash 347864750, now seen corresponding path program 1 times [2022-11-02 21:10:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:48,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837284953] [2022-11-02 21:10:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:10:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:10:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:10:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:10:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:49,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:49,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837284953] [2022-11-02 21:10:49,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837284953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:49,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:49,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:10:49,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2443500] [2022-11-02 21:10:49,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:49,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:49,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:49,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:49,125 INFO L87 Difference]: Start difference. First operand 27594 states and 42466 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:11:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:00,254 INFO L93 Difference]: Finished difference Result 89215 states and 142326 transitions. [2022-11-02 21:11:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 21:11:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2022-11-02 21:11:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:00,552 INFO L225 Difference]: With dead ends: 89215 [2022-11-02 21:11:00,552 INFO L226 Difference]: Without dead ends: 65966 [2022-11-02 21:11:00,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:11:00,666 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 1018 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:00,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 1751 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 21:11:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65966 states. [2022-11-02 21:11:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65966 to 50636. [2022-11-02 21:11:07,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50636 states, 44767 states have (on average 1.5098621752630286) internal successors, (67592), 45089 states have internal predecessors, (67592), 3557 states have call successors, (3557), 1932 states have call predecessors, (3557), 2310 states have return successors, (10575), 3876 states have call predecessors, (10575), 3556 states have call successors, (10575) [2022-11-02 21:11:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50636 states to 50636 states and 81724 transitions. [2022-11-02 21:11:08,311 INFO L78 Accepts]: Start accepts. Automaton has 50636 states and 81724 transitions. Word has length 101 [2022-11-02 21:11:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:08,312 INFO L495 AbstractCegarLoop]: Abstraction has 50636 states and 81724 transitions. [2022-11-02 21:11:08,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 21:11:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 50636 states and 81724 transitions. [2022-11-02 21:11:08,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:11:08,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:08,348 INFO L195 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] [2022-11-02 21:11:08,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:11:08,349 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2081969200, now seen corresponding path program 1 times [2022-11-02 21:11:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:08,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581163110] [2022-11-02 21:11:08,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:08,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:11:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-02 21:11:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:08,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:11:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-02 21:11:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:11:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:08,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581163110] [2022-11-02 21:11:08,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581163110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:08,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:08,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:11:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481264964] [2022-11-02 21:11:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:08,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:11:08,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:08,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:11:08,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:11:08,608 INFO L87 Difference]: Start difference. First operand 50636 states and 81724 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)