./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/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_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/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_466792e3-f975-46b7-96c8-9c1fc1fd76b4/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 b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd --- 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 20:54:52,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:54:52,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:54:52,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:54:52,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:54:52,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:54:52,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:54:52,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:54:52,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:54:52,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:54:52,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:54:52,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:54:52,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:54:52,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:54:52,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:54:52,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:54:52,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:54:52,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:54:52,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:54:52,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:54:52,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:54:52,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:54:52,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:54:52,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:54:52,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:54:52,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:54:52,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:54:52,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:54:52,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:54:52,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:54:52,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:54:52,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:54:52,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:54:52,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:54:52,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:54:52,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:54:52,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:54:52,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:54:52,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:54:52,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:54:52,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:54:52,613 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:54:52,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:54:52,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:54:52,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:54:52,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:54:52,657 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:54:52,657 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:54:52,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:54:52,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:54:52,659 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:54:52,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:54:52,659 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:54:52,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:54:52,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:54:52,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:54:52,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:54:52,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:54:52,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:54:52,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:54:52,661 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:54:52,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:54:52,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:54:52,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:54:52,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:54:52,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:54:52,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:52,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:54:52,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:54:52,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:54:52,664 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:54:52,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:54:52,664 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:54:52,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:54:52,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:54:52,665 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_466792e3-f975-46b7-96c8-9c1fc1fd76b4/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_466792e3-f975-46b7-96c8-9c1fc1fd76b4/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 -> b02d53de4cc8dbaebc187e8fa236234211af4eca5416c7869304d04f0d61a0bd [2022-11-02 20:54:52,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:54:52,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:54:52,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:54:52,928 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:54:52,929 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:54:52,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2022-11-02 20:54:53,006 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/data/e4056786b/e723bf5c718346858e3bf164b910e300/FLAG939eaf3d6 [2022-11-02 20:54:53,585 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:54:53,586 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c [2022-11-02 20:54:53,633 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/data/e4056786b/e723bf5c718346858e3bf164b910e300/FLAG939eaf3d6 [2022-11-02 20:54:53,827 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/data/e4056786b/e723bf5c718346858e3bf164b910e300 [2022-11-02 20:54:53,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:54:53,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:54:53,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:53,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:54:53,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:54:53,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:53" (1/1) ... [2022-11-02 20:54:53,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6548480f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:53, skipping insertion in model container [2022-11-02 20:54:53,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:54:53" (1/1) ... [2022-11-02 20:54:53,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:54:53,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:54:54,441 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_466792e3-f975-46b7-96c8-9c1fc1fd76b4/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c[40071,40084] [2022-11-02 20:54:54,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:54,620 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:54:54,682 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_466792e3-f975-46b7-96c8-9c1fc1fd76b4/sv-benchmarks/c/product-lines/elevator_spec2_product21.cil.c[40071,40084] [2022-11-02 20:54:54,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:54:54,792 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:54:54,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54 WrapperNode [2022-11-02 20:54:54,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:54:54,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:54,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:54:54,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:54:54,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,896 INFO L138 Inliner]: procedures = 92, calls = 339, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 861 [2022-11-02 20:54:54,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:54:54,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:54:54,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:54:54,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:54:54,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,955 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:54:54,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:54:54,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:54:54,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:54:54,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (1/1) ... [2022-11-02 20:54:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:54:54,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:55,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:54:55,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_466792e3-f975-46b7-96c8-9c1fc1fd76b4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:54:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:54:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2022-11-02 20:54:55,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2022-11-02 20:54:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2022-11-02 20:54:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2022-11-02 20:54:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2022-11-02 20:54:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2022-11-02 20:54:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2022-11-02 20:54:55,094 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2022-11-02 20:54:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2022-11-02 20:54:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2022-11-02 20:54:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-11-02 20:54:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-11-02 20:54:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-11-02 20:54:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-11-02 20:54:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2022-11-02 20:54:55,096 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2022-11-02 20:54:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2022-11-02 20:54:55,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2022-11-02 20:54:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2022-11-02 20:54:55,096 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2022-11-02 20:54:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2022-11-02 20:54:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2022-11-02 20:54:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2022-11-02 20:54:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2022-11-02 20:54:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2022-11-02 20:54:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2022-11-02 20:54:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2022-11-02 20:54:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2022-11-02 20:54:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2022-11-02 20:54:55,098 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2022-11-02 20:54:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2022-11-02 20:54:55,098 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2022-11-02 20:54:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2022-11-02 20:54:55,099 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2022-11-02 20:54:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2022-11-02 20:54:55,099 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2022-11-02 20:54:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:54:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2022-11-02 20:54:55,099 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2022-11-02 20:54:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2022-11-02 20:54:55,099 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2022-11-02 20:54:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2022-11-02 20:54:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2022-11-02 20:54:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2022-11-02 20:54:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2022-11-02 20:54:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2022-11-02 20:54:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2022-11-02 20:54:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:54:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:54:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2022-11-02 20:54:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2022-11-02 20:54:55,337 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:54:55,345 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:54:56,624 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:54:56,649 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:54:56,649 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:54:56,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:56 BoogieIcfgContainer [2022-11-02 20:54:56,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:54:56,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:54:56,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:54:56,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:54:56,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:54:53" (1/3) ... [2022-11-02 20:54:56,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26795a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:56, skipping insertion in model container [2022-11-02 20:54:56,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:54:54" (2/3) ... [2022-11-02 20:54:56,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26795a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:56, skipping insertion in model container [2022-11-02 20:54:56,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:56" (3/3) ... [2022-11-02 20:54:56,665 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product21.cil.c [2022-11-02 20:54:56,686 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:54:56,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:54:56,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:54:56,759 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;@1fe0d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:54:56,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:54:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 563 states, 442 states have (on average 1.6945701357466063) internal successors, (749), 463 states have internal predecessors, (749), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2022-11-02 20:54:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-02 20:54:56,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:56,794 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] [2022-11-02 20:54:56,795 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:56,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1455804326, now seen corresponding path program 1 times [2022-11-02 20:54:56,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:56,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635881762] [2022-11-02 20:54:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:57,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:54:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:57,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:57,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:54:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-02 20:54:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:54:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:54:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:54:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:58,547 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 20:54:58,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:58,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635881762] [2022-11-02 20:54:58,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635881762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:58,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:58,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 20:54:58,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589621313] [2022-11-02 20:54:58,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:58,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:54:58,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:58,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:54:58,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:54:58,608 INFO L87 Difference]: Start difference. First operand has 563 states, 442 states have (on average 1.6945701357466063) internal successors, (749), 463 states have internal predecessors, (749), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:55:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:10,503 INFO L93 Difference]: Finished difference Result 1407 states and 2392 transitions. [2022-11-02 20:55:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:55:10,506 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2022-11-02 20:55:10,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:10,532 INFO L225 Difference]: With dead ends: 1407 [2022-11-02 20:55:10,533 INFO L226 Difference]: Without dead ends: 856 [2022-11-02 20:55:10,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:55:10,548 INFO L413 NwaCegarLoop]: 1018 mSDtfsCounter, 1032 mSDsluCounter, 4787 mSDsCounter, 0 mSdLazyCounter, 7644 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 5805 SdHoareTripleChecker+Invalid, 7966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 7644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:10,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 5805 Invalid, 7966 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [322 Valid, 7644 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-11-02 20:55:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-11-02 20:55:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 562. [2022-11-02 20:55:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 441 states have (on average 1.6825396825396826) internal successors, (742), 460 states have internal predecessors, (742), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 90 states have call predecessors, (95), 90 states have call successors, (95) [2022-11-02 20:55:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 932 transitions. [2022-11-02 20:55:10,782 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 932 transitions. Word has length 88 [2022-11-02 20:55:10,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:10,782 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 932 transitions. [2022-11-02 20:55:10,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:55:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 932 transitions. [2022-11-02 20:55:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:55:10,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:10,789 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] [2022-11-02 20:55:10,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:55:10,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 948764847, now seen corresponding path program 1 times [2022-11-02 20:55:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:10,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483195103] [2022-11-02 20:55:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:55:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:55:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:55:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:55:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:55:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:55:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:11,535 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 20:55:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:11,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483195103] [2022-11-02 20:55:11,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483195103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:11,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:11,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213110562] [2022-11-02 20:55:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:11,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:11,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:11,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:11,539 INFO L87 Difference]: Start difference. First operand 562 states and 932 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:55:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:21,786 INFO L93 Difference]: Finished difference Result 1407 states and 2375 transitions. [2022-11-02 20:55:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:55:21,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2022-11-02 20:55:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:21,795 INFO L225 Difference]: With dead ends: 1407 [2022-11-02 20:55:21,796 INFO L226 Difference]: Without dead ends: 863 [2022-11-02 20:55:21,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:55:21,801 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 1010 mSDsluCounter, 4191 mSDsCounter, 0 mSdLazyCounter, 6840 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 5206 SdHoareTripleChecker+Invalid, 7143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 6840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:21,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 5206 Invalid, 7143 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [303 Valid, 6840 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-11-02 20:55:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2022-11-02 20:55:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 563. [2022-11-02 20:55:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 442 states have (on average 1.6787330316742082) internal successors, (742), 460 states have internal predecessors, (742), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 91 states have call predecessors, (95), 90 states have call successors, (95) [2022-11-02 20:55:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 932 transitions. [2022-11-02 20:55:21,965 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 932 transitions. Word has length 92 [2022-11-02 20:55:21,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:21,967 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 932 transitions. [2022-11-02 20:55:21,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:55:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 932 transitions. [2022-11-02 20:55:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-02 20:55:21,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:21,976 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] [2022-11-02 20:55:21,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:55:21,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash -616746716, now seen corresponding path program 1 times [2022-11-02 20:55:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:21,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97051243] [2022-11-02 20:55:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:55:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:55:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:55:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:55:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:55:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:55:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:22,650 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 20:55:22,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:22,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97051243] [2022-11-02 20:55:22,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97051243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:22,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:22,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:55:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270915391] [2022-11-02 20:55:22,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:22,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:55:22,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:55:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:55:22,659 INFO L87 Difference]: Start difference. First operand 563 states and 932 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:55:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:29,667 INFO L93 Difference]: Finished difference Result 1384 states and 2337 transitions. [2022-11-02 20:55:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:55:29,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2022-11-02 20:55:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:29,676 INFO L225 Difference]: With dead ends: 1384 [2022-11-02 20:55:29,676 INFO L226 Difference]: Without dead ends: 839 [2022-11-02 20:55:29,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:29,682 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 1889 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 3960 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 4571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 3960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:29,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 3201 Invalid, 4571 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [611 Valid, 3960 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-11-02 20:55:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-11-02 20:55:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 566. [2022-11-02 20:55:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 445 states have (on average 1.6741573033707866) internal successors, (745), 463 states have internal predecessors, (745), 95 states have call successors, (95), 24 states have call predecessors, (95), 25 states have return successors, (95), 91 states have call predecessors, (95), 90 states have call successors, (95) [2022-11-02 20:55:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 935 transitions. [2022-11-02 20:55:29,837 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 935 transitions. Word has length 93 [2022-11-02 20:55:29,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:29,837 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 935 transitions. [2022-11-02 20:55:29,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:55:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 935 transitions. [2022-11-02 20:55:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-02 20:55:29,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:29,841 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] [2022-11-02 20:55:29,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:55:29,841 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1331480081, now seen corresponding path program 1 times [2022-11-02 20:55:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:29,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445264162] [2022-11-02 20:55:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:55:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:55:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 20:55:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:55:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:55:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:55:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:30,447 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 20:55:30,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:30,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445264162] [2022-11-02 20:55:30,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445264162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:30,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:30,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469971290] [2022-11-02 20:55:30,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:30,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:30,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:30,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:30,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:30,450 INFO L87 Difference]: Start difference. First operand 566 states and 935 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:55:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:48,876 INFO L93 Difference]: Finished difference Result 2619 states and 4594 transitions. [2022-11-02 20:55:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:55:48,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2022-11-02 20:55:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:48,896 INFO L225 Difference]: With dead ends: 2619 [2022-11-02 20:55:48,897 INFO L226 Difference]: Without dead ends: 2071 [2022-11-02 20:55:48,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:55:48,913 INFO L413 NwaCegarLoop]: 1083 mSDtfsCounter, 4559 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 8471 mSolverCounterSat, 1936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4646 SdHoareTripleChecker+Valid, 4810 SdHoareTripleChecker+Invalid, 10407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1936 IncrementalHoareTripleChecker+Valid, 8471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:48,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4646 Valid, 4810 Invalid, 10407 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1936 Valid, 8471 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2022-11-02 20:55:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2022-11-02 20:55:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1505. [2022-11-02 20:55:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1169 states have (on average 1.6338751069289992) internal successors, (1910), 1213 states have internal predecessors, (1910), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2022-11-02 20:55:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2499 transitions. [2022-11-02 20:55:49,357 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2499 transitions. Word has length 97 [2022-11-02 20:55:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:49,357 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 2499 transitions. [2022-11-02 20:55:49,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-02 20:55:49,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2499 transitions. [2022-11-02 20:55:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-02 20:55:49,361 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:49,362 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] [2022-11-02 20:55:49,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:55:49,362 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1768307324, now seen corresponding path program 1 times [2022-11-02 20:55:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:49,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930102607] [2022-11-02 20:55:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:55:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:55:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-02 20:55:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:55:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:55:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:49,887 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 20:55:49,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930102607] [2022-11-02 20:55:49,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930102607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:49,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:49,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:55:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673134049] [2022-11-02 20:55:49,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:49,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:55:49,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:49,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:55:49,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:55:49,891 INFO L87 Difference]: Start difference. First operand 1505 states and 2499 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:55:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:57,026 INFO L93 Difference]: Finished difference Result 3521 states and 5964 transitions. [2022-11-02 20:55:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:55:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2022-11-02 20:55:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:57,044 INFO L225 Difference]: With dead ends: 3521 [2022-11-02 20:55:57,044 INFO L226 Difference]: Without dead ends: 2034 [2022-11-02 20:55:57,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:55:57,054 INFO L413 NwaCegarLoop]: 969 mSDtfsCounter, 955 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:57,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2398 Invalid, 2862 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [271 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-02 20:55:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-11-02 20:55:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1505. [2022-11-02 20:55:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1169 states have (on average 1.6330196749358425) internal successors, (1909), 1213 states have internal predecessors, (1909), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 262 states have call predecessors, (325), 259 states have call successors, (325) [2022-11-02 20:55:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2498 transitions. [2022-11-02 20:55:57,400 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2498 transitions. Word has length 99 [2022-11-02 20:55:57,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:57,401 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 2498 transitions. [2022-11-02 20:55:57,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:55:57,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2498 transitions. [2022-11-02 20:55:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-02 20:55:57,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:57,405 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] [2022-11-02 20:55:57,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:55:57,406 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1493508725, now seen corresponding path program 1 times [2022-11-02 20:55:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:57,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172464913] [2022-11-02 20:55:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:55:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:55:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:57,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:55:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:55:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 20:55:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:55:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:58,277 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 20:55:58,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:58,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172464913] [2022-11-02 20:55:58,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172464913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:58,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:58,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:55:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483868573] [2022-11-02 20:55:58,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:58,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:55:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:55:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:55:58,280 INFO L87 Difference]: Start difference. First operand 1505 states and 2498 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:56:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:09,521 INFO L93 Difference]: Finished difference Result 3564 states and 6075 transitions. [2022-11-02 20:56:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:56:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2022-11-02 20:56:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:09,539 INFO L225 Difference]: With dead ends: 3564 [2022-11-02 20:56:09,539 INFO L226 Difference]: Without dead ends: 2117 [2022-11-02 20:56:09,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:56:09,549 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 1079 mSDsluCounter, 5186 mSDsCounter, 0 mSdLazyCounter, 8430 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 6143 SdHoareTripleChecker+Invalid, 8809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 8430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:09,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 6143 Invalid, 8809 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [379 Valid, 8430 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-11-02 20:56:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2022-11-02 20:56:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1508. [2022-11-02 20:56:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1213 states have internal predecessors, (1907), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 265 states have call predecessors, (325), 259 states have call successors, (325) [2022-11-02 20:56:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2496 transitions. [2022-11-02 20:56:10,049 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2496 transitions. Word has length 100 [2022-11-02 20:56:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:10,049 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 2496 transitions. [2022-11-02 20:56:10,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:56:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2496 transitions. [2022-11-02 20:56:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 20:56:10,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:10,055 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:10,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:56:10,056 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:10,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1885329652, now seen corresponding path program 1 times [2022-11-02 20:56:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:10,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680844245] [2022-11-02 20:56:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:10,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:56:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:56:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 20:56:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:56:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:56:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:56:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:56:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:10,721 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 20:56:10,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:10,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680844245] [2022-11-02 20:56:10,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680844245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:10,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:10,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:56:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231538352] [2022-11-02 20:56:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:10,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:56:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:56:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:56:10,724 INFO L87 Difference]: Start difference. First operand 1508 states and 2496 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:56:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:17,629 INFO L93 Difference]: Finished difference Result 3487 states and 5889 transitions. [2022-11-02 20:56:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:56:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2022-11-02 20:56:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:17,648 INFO L225 Difference]: With dead ends: 3487 [2022-11-02 20:56:17,648 INFO L226 Difference]: Without dead ends: 2037 [2022-11-02 20:56:17,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:56:17,657 INFO L413 NwaCegarLoop]: 906 mSDtfsCounter, 1915 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 3898 mSolverCounterSat, 639 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 3104 SdHoareTripleChecker+Invalid, 4537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 639 IncrementalHoareTripleChecker+Valid, 3898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:17,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 3104 Invalid, 4537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [639 Valid, 3898 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-02 20:56:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2022-11-02 20:56:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 1508. [2022-11-02 20:56:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1172 states have (on average 1.6228668941979523) internal successors, (1902), 1213 states have internal predecessors, (1902), 264 states have call successors, (264), 65 states have call predecessors, (264), 71 states have return successors, (325), 265 states have call predecessors, (325), 259 states have call successors, (325) [2022-11-02 20:56:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2491 transitions. [2022-11-02 20:56:18,180 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2491 transitions. Word has length 109 [2022-11-02 20:56:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:18,181 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 2491 transitions. [2022-11-02 20:56:18,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:56:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2491 transitions. [2022-11-02 20:56:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-02 20:56:18,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:18,186 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:18,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:56:18,186 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash 567024900, now seen corresponding path program 1 times [2022-11-02 20:56:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:18,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488941118] [2022-11-02 20:56:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:18,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:18,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:56:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:18,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:18,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:56:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:18,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:56:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:19,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:56:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:56:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:19,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:19,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:56:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:19,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:56:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:19,277 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 20:56:19,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:19,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488941118] [2022-11-02 20:56:19,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488941118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:19,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:19,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-02 20:56:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745703606] [2022-11-02 20:56:19,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:19,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:56:19,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:19,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:56:19,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:56:19,280 INFO L87 Difference]: Start difference. First operand 1508 states and 2491 transitions. Second operand has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 15 states have internal predecessors, (86), 5 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-02 20:56:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:39,551 INFO L93 Difference]: Finished difference Result 3883 states and 6589 transitions. [2022-11-02 20:56:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-02 20:56:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 15 states have internal predecessors, (86), 5 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 109 [2022-11-02 20:56:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:39,571 INFO L225 Difference]: With dead ends: 3883 [2022-11-02 20:56:39,571 INFO L226 Difference]: Without dead ends: 2399 [2022-11-02 20:56:39,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=306, Invalid=1764, Unknown=0, NotChecked=0, Total=2070 [2022-11-02 20:56:39,580 INFO L413 NwaCegarLoop]: 908 mSDtfsCounter, 3027 mSDsluCounter, 6648 mSDsCounter, 0 mSdLazyCounter, 14167 mSolverCounterSat, 1022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3094 SdHoareTripleChecker+Valid, 7556 SdHoareTripleChecker+Invalid, 15189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1022 IncrementalHoareTripleChecker+Valid, 14167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:39,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3094 Valid, 7556 Invalid, 15189 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1022 Valid, 14167 Invalid, 0 Unknown, 0 Unchecked, 15.2s Time] [2022-11-02 20:56:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2022-11-02 20:56:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 1833. [2022-11-02 20:56:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1442 states have (on average 1.6067961165048543) internal successors, (2317), 1487 states have internal predecessors, (2317), 304 states have call successors, (304), 75 states have call predecessors, (304), 86 states have return successors, (386), 306 states have call predecessors, (386), 299 states have call successors, (386) [2022-11-02 20:56:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 3007 transitions. [2022-11-02 20:56:40,251 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 3007 transitions. Word has length 109 [2022-11-02 20:56:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:40,252 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 3007 transitions. [2022-11-02 20:56:40,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 15 states have internal predecessors, (86), 5 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-02 20:56:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 3007 transitions. [2022-11-02 20:56:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 20:56:40,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:40,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:40,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:56:40,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1990101007, now seen corresponding path program 1 times [2022-11-02 20:56:40,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:40,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850848973] [2022-11-02 20:56:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:56:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:56:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:56:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:56:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:56:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:56:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:56:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,881 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 20:56:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:40,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850848973] [2022-11-02 20:56:40,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850848973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:40,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:40,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:56:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726484055] [2022-11-02 20:56:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:40,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:56:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:56:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:56:40,884 INFO L87 Difference]: Start difference. First operand 1833 states and 3007 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:56:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:47,691 INFO L93 Difference]: Finished difference Result 4151 states and 6952 transitions. [2022-11-02 20:56:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:56:47,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2022-11-02 20:56:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:47,714 INFO L225 Difference]: With dead ends: 4151 [2022-11-02 20:56:47,714 INFO L226 Difference]: Without dead ends: 2376 [2022-11-02 20:56:47,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:56:47,725 INFO L413 NwaCegarLoop]: 911 mSDtfsCounter, 1490 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 3886 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 4351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 3886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:47,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 3184 Invalid, 4351 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [465 Valid, 3886 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-02 20:56:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2022-11-02 20:56:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1833. [2022-11-02 20:56:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1442 states have (on average 1.6033287101248266) internal successors, (2312), 1487 states have internal predecessors, (2312), 304 states have call successors, (304), 75 states have call predecessors, (304), 86 states have return successors, (386), 306 states have call predecessors, (386), 299 states have call successors, (386) [2022-11-02 20:56:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 3002 transitions. [2022-11-02 20:56:48,383 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 3002 transitions. Word has length 111 [2022-11-02 20:56:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:48,383 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 3002 transitions. [2022-11-02 20:56:48,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:56:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 3002 transitions. [2022-11-02 20:56:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-02 20:56:48,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:48,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:48,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:56:48,389 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:48,389 INFO L85 PathProgramCache]: Analyzing trace with hash -621672818, now seen corresponding path program 1 times [2022-11-02 20:56:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:48,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027075329] [2022-11-02 20:56:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:56:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:56:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 20:56:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:56:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:56:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:56:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:56:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:48,932 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 20:56:48,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:48,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027075329] [2022-11-02 20:56:48,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027075329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:48,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:48,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:56:48,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586411700] [2022-11-02 20:56:48,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:48,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:56:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:48,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:56:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:56:48,934 INFO L87 Difference]: Start difference. First operand 1833 states and 3002 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:56:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:56,207 INFO L93 Difference]: Finished difference Result 4166 states and 6967 transitions. [2022-11-02 20:56:56,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:56:56,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2022-11-02 20:56:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:56,228 INFO L225 Difference]: With dead ends: 4166 [2022-11-02 20:56:56,229 INFO L226 Difference]: Without dead ends: 2397 [2022-11-02 20:56:56,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:56:56,238 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 1006 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:56,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 2338 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-11-02 20:56:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2022-11-02 20:56:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1835. [2022-11-02 20:56:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1444 states have (on average 1.6024930747922437) internal successors, (2314), 1489 states have internal predecessors, (2314), 304 states have call successors, (304), 75 states have call predecessors, (304), 86 states have return successors, (386), 306 states have call predecessors, (386), 299 states have call successors, (386) [2022-11-02 20:56:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 3004 transitions. [2022-11-02 20:56:56,868 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 3004 transitions. Word has length 111 [2022-11-02 20:56:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:56,868 INFO L495 AbstractCegarLoop]: Abstraction has 1835 states and 3004 transitions. [2022-11-02 20:56:56,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:56:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 3004 transitions. [2022-11-02 20:56:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 20:56:56,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:56,874 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:56,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:56:56,874 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:56,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1763521623, now seen corresponding path program 1 times [2022-11-02 20:56:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:56,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754341000] [2022-11-02 20:56:56,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:56,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:56:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:56:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:56:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:56:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:56:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:56:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:56:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:57,540 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 20:56:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754341000] [2022-11-02 20:56:57,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754341000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:57,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:57,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:56:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982852121] [2022-11-02 20:56:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:57,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:56:57,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:57,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:56:57,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:56:57,544 INFO L87 Difference]: Start difference. First operand 1835 states and 3004 transitions. Second operand has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:05,243 INFO L93 Difference]: Finished difference Result 4157 states and 6953 transitions. [2022-11-02 20:57:05,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:57:05,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2022-11-02 20:57:05,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:05,259 INFO L225 Difference]: With dead ends: 4157 [2022-11-02 20:57:05,259 INFO L226 Difference]: Without dead ends: 2380 [2022-11-02 20:57:05,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:57:05,268 INFO L413 NwaCegarLoop]: 903 mSDtfsCounter, 1041 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 4062 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3219 SdHoareTripleChecker+Invalid, 4368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 4062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:05,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3219 Invalid, 4368 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [306 Valid, 4062 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-11-02 20:57:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2022-11-02 20:57:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 1835. [2022-11-02 20:57:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1444 states have (on average 1.5990304709141274) internal successors, (2309), 1489 states have internal predecessors, (2309), 304 states have call successors, (304), 75 states have call predecessors, (304), 86 states have return successors, (386), 306 states have call predecessors, (386), 299 states have call successors, (386) [2022-11-02 20:57:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2999 transitions. [2022-11-02 20:57:05,765 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2999 transitions. Word has length 112 [2022-11-02 20:57:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:05,766 INFO L495 AbstractCegarLoop]: Abstraction has 1835 states and 2999 transitions. [2022-11-02 20:57:05,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.88888888888889) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2999 transitions. [2022-11-02 20:57:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 20:57:05,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:05,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:05,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:57:05,771 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1537611596, now seen corresponding path program 1 times [2022-11-02 20:57:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:05,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925819487] [2022-11-02 20:57:05,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:05,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:05,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:57:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:57:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:57:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:57:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:57:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:57:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:57:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:06,310 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 20:57:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:06,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925819487] [2022-11-02 20:57:06,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925819487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:06,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:06,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191719946] [2022-11-02 20:57:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:06,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:06,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:06,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:06,313 INFO L87 Difference]: Start difference. First operand 1835 states and 2999 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:13,822 INFO L93 Difference]: Finished difference Result 4170 states and 6964 transitions. [2022-11-02 20:57:13,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:57:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2022-11-02 20:57:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:13,840 INFO L225 Difference]: With dead ends: 4170 [2022-11-02 20:57:13,840 INFO L226 Difference]: Without dead ends: 2401 [2022-11-02 20:57:13,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:57:13,850 INFO L413 NwaCegarLoop]: 918 mSDtfsCounter, 1012 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:13,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 2333 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-02 20:57:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2022-11-02 20:57:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1838. [2022-11-02 20:57:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1447 states have (on average 1.5977885279889426) internal successors, (2312), 1492 states have internal predecessors, (2312), 304 states have call successors, (304), 75 states have call predecessors, (304), 86 states have return successors, (386), 306 states have call predecessors, (386), 299 states have call successors, (386) [2022-11-02 20:57:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 3002 transitions. [2022-11-02 20:57:14,412 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 3002 transitions. Word has length 112 [2022-11-02 20:57:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:14,412 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 3002 transitions. [2022-11-02 20:57:14,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 3002 transitions. [2022-11-02 20:57:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:57:14,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:57:14,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:57:14,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash -417082582, now seen corresponding path program 1 times [2022-11-02 20:57:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:14,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773103559] [2022-11-02 20:57:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:14,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:14,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:57:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:14,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:57:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:57:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:15,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:15,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:57:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:15,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:57:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:57:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:57:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:15,058 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 20:57:15,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:15,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773103559] [2022-11-02 20:57:15,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773103559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:15,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:15,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:57:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973083123] [2022-11-02 20:57:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:15,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:57:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:15,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:57:15,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:57:15,062 INFO L87 Difference]: Start difference. First operand 1838 states and 3002 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:57:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:24,804 INFO L93 Difference]: Finished difference Result 4174 states and 6970 transitions. [2022-11-02 20:57:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:57:24,805 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-11-02 20:57:24,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:24,864 INFO L225 Difference]: With dead ends: 4174 [2022-11-02 20:57:24,864 INFO L226 Difference]: Without dead ends: 2408 [2022-11-02 20:57:24,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:57:24,872 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 1497 mSDsluCounter, 3696 mSDsCounter, 0 mSdLazyCounter, 6384 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 4638 SdHoareTripleChecker+Invalid, 6826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 6384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:24,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 4638 Invalid, 6826 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [442 Valid, 6384 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-11-02 20:57:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2022-11-02 20:57:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1849. [2022-11-02 20:57:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1849 states, 1455 states have (on average 1.5965635738831616) internal successors, (2323), 1502 states have internal predecessors, (2323), 305 states have call successors, (305), 75 states have call predecessors, (305), 88 states have return successors, (389), 307 states have call predecessors, (389), 300 states have call successors, (389) [2022-11-02 20:57:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 3017 transitions. [2022-11-02 20:57:25,460 INFO L78 Accepts]: Start accepts. Automaton has 1849 states and 3017 transitions. Word has length 113 [2022-11-02 20:57:25,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:25,460 INFO L495 AbstractCegarLoop]: Abstraction has 1849 states and 3017 transitions. [2022-11-02 20:57:25,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 20:57:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1849 states and 3017 transitions. [2022-11-02 20:57:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:57:25,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:25,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:25,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:57:25,467 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:25,468 INFO L85 PathProgramCache]: Analyzing trace with hash -622120727, now seen corresponding path program 1 times [2022-11-02 20:57:25,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:25,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857822154] [2022-11-02 20:57:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:57:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:57:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:57:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:57:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:57:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:57:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:57:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:26,080 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 20:57:26,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:26,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857822154] [2022-11-02 20:57:26,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857822154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:26,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:26,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:26,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83820267] [2022-11-02 20:57:26,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:26,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:26,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:26,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:26,084 INFO L87 Difference]: Start difference. First operand 1849 states and 3017 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:33,432 INFO L93 Difference]: Finished difference Result 4197 states and 7001 transitions. [2022-11-02 20:57:33,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:57:33,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2022-11-02 20:57:33,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:33,445 INFO L225 Difference]: With dead ends: 4197 [2022-11-02 20:57:33,445 INFO L226 Difference]: Without dead ends: 2425 [2022-11-02 20:57:33,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:57:33,452 INFO L413 NwaCegarLoop]: 917 mSDtfsCounter, 1463 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:33,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 2253 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-02 20:57:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2022-11-02 20:57:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 1853. [2022-11-02 20:57:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1459 states have (on average 1.5942426319396847) internal successors, (2326), 1506 states have internal predecessors, (2326), 305 states have call successors, (305), 75 states have call predecessors, (305), 88 states have return successors, (389), 307 states have call predecessors, (389), 300 states have call successors, (389) [2022-11-02 20:57:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 3020 transitions. [2022-11-02 20:57:34,058 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 3020 transitions. Word has length 113 [2022-11-02 20:57:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:34,058 INFO L495 AbstractCegarLoop]: Abstraction has 1853 states and 3020 transitions. [2022-11-02 20:57:34,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 3020 transitions. [2022-11-02 20:57:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:57:34,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:34,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:34,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:57:34,062 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:34,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:34,063 INFO L85 PathProgramCache]: Analyzing trace with hash -945448183, now seen corresponding path program 1 times [2022-11-02 20:57:34,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:34,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677683870] [2022-11-02 20:57:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:57:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:57:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 20:57:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:57:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:57:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:57:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:57:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:34,521 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 20:57:34,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:34,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677683870] [2022-11-02 20:57:34,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677683870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:34,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:34,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:34,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337953604] [2022-11-02 20:57:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:34,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:34,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:34,524 INFO L87 Difference]: Start difference. First operand 1853 states and 3020 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:41,058 INFO L93 Difference]: Finished difference Result 4239 states and 7044 transitions. [2022-11-02 20:57:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:57:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2022-11-02 20:57:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:41,072 INFO L225 Difference]: With dead ends: 4239 [2022-11-02 20:57:41,072 INFO L226 Difference]: Without dead ends: 2384 [2022-11-02 20:57:41,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:57:41,079 INFO L413 NwaCegarLoop]: 930 mSDtfsCounter, 1816 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:41,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 2218 Invalid, 2810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-02 20:57:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2022-11-02 20:57:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 1834. [2022-11-02 20:57:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1443 states have (on average 1.5966735966735968) internal successors, (2304), 1488 states have internal predecessors, (2304), 304 states have call successors, (304), 75 states have call predecessors, (304), 86 states have return successors, (386), 306 states have call predecessors, (386), 299 states have call successors, (386) [2022-11-02 20:57:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2994 transitions. [2022-11-02 20:57:41,651 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2994 transitions. Word has length 113 [2022-11-02 20:57:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:41,651 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 2994 transitions. [2022-11-02 20:57:41,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2994 transitions. [2022-11-02 20:57:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:57:41,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:41,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:41,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:57:41,655 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:41,656 INFO L85 PathProgramCache]: Analyzing trace with hash 767581575, now seen corresponding path program 1 times [2022-11-02 20:57:41,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:41,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428132954] [2022-11-02 20:57:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:57:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:41,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:57:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 20:57:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:57:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:57:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:57:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:57:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:42,186 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 20:57:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:42,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428132954] [2022-11-02 20:57:42,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428132954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:42,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:42,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:57:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999604942] [2022-11-02 20:57:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:42,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:57:42,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:57:42,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:57:42,191 INFO L87 Difference]: Start difference. First operand 1834 states and 2994 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:57:48,788 INFO L93 Difference]: Finished difference Result 4174 states and 6959 transitions. [2022-11-02 20:57:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:57:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2022-11-02 20:57:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:57:48,804 INFO L225 Difference]: With dead ends: 4174 [2022-11-02 20:57:48,805 INFO L226 Difference]: Without dead ends: 2405 [2022-11-02 20:57:48,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:57:48,809 INFO L413 NwaCegarLoop]: 919 mSDtfsCounter, 1856 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 2217 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:57:48,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1936 Valid, 2217 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-02 20:57:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2022-11-02 20:57:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1839. [2022-11-02 20:57:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1448 states have (on average 1.5946132596685083) internal successors, (2309), 1493 states have internal predecessors, (2309), 304 states have call successors, (304), 75 states have call predecessors, (304), 86 states have return successors, (386), 306 states have call predecessors, (386), 299 states have call successors, (386) [2022-11-02 20:57:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2999 transitions. [2022-11-02 20:57:49,302 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2999 transitions. Word has length 114 [2022-11-02 20:57:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:57:49,302 INFO L495 AbstractCegarLoop]: Abstraction has 1839 states and 2999 transitions. [2022-11-02 20:57:49,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 20:57:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2999 transitions. [2022-11-02 20:57:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:57:49,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:57:49,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:49,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:57:49,306 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:57:49,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:49,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1842427084, now seen corresponding path program 1 times [2022-11-02 20:57:49,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:49,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852829863] [2022-11-02 20:57:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:49,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:57:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:49,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:57:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:57:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:57:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:57:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:57:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:57:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:57:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:57:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:50,296 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 20:57:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:50,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852829863] [2022-11-02 20:57:50,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852829863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:50,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:50,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-02 20:57:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090746810] [2022-11-02 20:57:50,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:50,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:57:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:50,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:57:50,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:57:50,299 INFO L87 Difference]: Start difference. First operand 1839 states and 2999 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 12 states have internal predecessors, (92), 7 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-02 20:58:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:08,073 INFO L93 Difference]: Finished difference Result 5960 states and 10180 transitions. [2022-11-02 20:58:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:58:08,074 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 12 states have internal predecessors, (92), 7 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 115 [2022-11-02 20:58:08,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:08,095 INFO L225 Difference]: With dead ends: 5960 [2022-11-02 20:58:08,095 INFO L226 Difference]: Without dead ends: 4200 [2022-11-02 20:58:08,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2022-11-02 20:58:08,101 INFO L413 NwaCegarLoop]: 806 mSDtfsCounter, 8455 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 7547 mSolverCounterSat, 3073 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8455 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 10620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3073 IncrementalHoareTripleChecker+Valid, 7547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:08,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8455 Valid, 3487 Invalid, 10620 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3073 Valid, 7547 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2022-11-02 20:58:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states. [2022-11-02 20:58:09,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 3269. [2022-11-02 20:58:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 2576 states have (on average 1.5869565217391304) internal successors, (4088), 2651 states have internal predecessors, (4088), 516 states have call successors, (516), 134 states have call predecessors, (516), 176 states have return successors, (734), 543 states have call predecessors, (734), 511 states have call successors, (734) [2022-11-02 20:58:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 5338 transitions. [2022-11-02 20:58:09,020 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 5338 transitions. Word has length 115 [2022-11-02 20:58:09,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:58:09,021 INFO L495 AbstractCegarLoop]: Abstraction has 3269 states and 5338 transitions. [2022-11-02 20:58:09,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 12 states have internal predecessors, (92), 7 states have call successors, (12), 5 states have call predecessors, (12), 7 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-11-02 20:58:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 5338 transitions. [2022-11-02 20:58:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-11-02 20:58:09,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:58:09,024 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:58:09,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:58:09,025 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:58:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:58:09,025 INFO L85 PathProgramCache]: Analyzing trace with hash -689814014, now seen corresponding path program 1 times [2022-11-02 20:58:09,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:58:09,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744942337] [2022-11-02 20:58:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:58:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:58:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:58:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:58:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:58:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:58:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:58:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-02 20:58:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:58:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:58:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:58:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:58:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:58:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:58:09,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744942337] [2022-11-02 20:58:09,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744942337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:58:09,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:58:09,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:58:09,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892524249] [2022-11-02 20:58:09,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:58:09,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:58:09,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:58:09,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:58:09,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:58:09,769 INFO L87 Difference]: Start difference. First operand 3269 states and 5338 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 6 states have internal predecessors, (93), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-11-02 20:58:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:58:21,567 INFO L93 Difference]: Finished difference Result 10242 states and 17266 transitions. [2022-11-02 20:58:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:58:21,567 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 6 states have internal predecessors, (93), 4 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 120 [2022-11-02 20:58:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:58:21,610 INFO L225 Difference]: With dead ends: 10242 [2022-11-02 20:58:21,610 INFO L226 Difference]: Without dead ends: 7051 [2022-11-02 20:58:21,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:58:21,627 INFO L413 NwaCegarLoop]: 1361 mSDtfsCounter, 4021 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 1877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4021 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 4025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1877 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:58:21,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4021 Valid, 2157 Invalid, 4025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1877 Valid, 2148 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-11-02 20:58:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7051 states.