./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX --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 4863b1f1d4b898d74c0df74738b7a6c95d5e4b7b1780f99116ba75ba156137bf --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:34:57,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:34:57,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:34:57,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:34:57,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:34:57,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:34:57,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:34:57,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:34:57,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:34:57,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:34:57,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:34:57,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:34:57,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:34:57,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:34:57,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:34:57,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:34:57,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:34:57,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:34:57,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:34:57,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:34:57,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:34:57,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:34:57,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:34:57,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:34:57,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:34:57,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:34:57,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:34:57,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:34:57,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:34:57,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:34:57,591 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:34:57,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:34:57,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:34:57,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:34:57,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:34:57,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:34:57,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:34:57,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:34:57,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:34:57,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:34:57,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:34:57,604 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 09:34:57,635 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:34:57,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:34:57,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:34:57,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:34:57,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:34:57,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:34:57,639 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:34:57,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:34:57,640 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:34:57,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:34:57,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:34:57,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:34:57,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:34:57,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:34:57,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:34:57,642 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:34:57,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:34:57,643 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:34:57,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:34:57,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:34:57,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:34:57,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:34:57,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:34:57,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:34:57,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:34:57,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:34:57,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:34:57,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 09:34:57,646 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:34:57,647 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:34:57,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:34:57,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:34:57,648 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_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/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_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX 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 -> 4863b1f1d4b898d74c0df74738b7a6c95d5e4b7b1780f99116ba75ba156137bf [2021-11-09 09:34:58,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:34:58,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:34:58,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:34:58,070 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:34:58,071 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:34:58,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2021-11-09 09:34:58,167 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data/21503708f/ad8848c493914ffb8aa1aec3b9a62ce3/FLAG13c0c0e88 [2021-11-09 09:34:58,884 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:34:58,884 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2021-11-09 09:34:58,906 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data/21503708f/ad8848c493914ffb8aa1aec3b9a62ce3/FLAG13c0c0e88 [2021-11-09 09:34:59,068 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data/21503708f/ad8848c493914ffb8aa1aec3b9a62ce3 [2021-11-09 09:34:59,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:34:59,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:34:59,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:34:59,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:34:59,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:34:59,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:34:59,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a885894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59, skipping insertion in model container [2021-11-09 09:34:59,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:34:59,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:34:59,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:34:59,589 WARN L228 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_d10df17c-513a-40c4-9ed3-b701978f147d/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2021-11-09 09:34:59,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:34:59,614 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:34:59,799 WARN L228 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_d10df17c-513a-40c4-9ed3-b701978f147d/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2021-11-09 09:34:59,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:34:59,834 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:34:59,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59 WrapperNode [2021-11-09 09:34:59,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:34:59,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:34:59,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:34:59,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:34:59,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:34:59,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:35:00,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:35:00,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:35:00,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:35:00,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:35:00,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:35:00,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:35:00,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:35:00,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (1/1) ... [2021-11-09 09:35:00,224 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:35:00,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:35:00,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:35:00,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:35:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-09 09:35:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:35:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 09:35:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 09:35:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-09 09:35:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:35:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-09 09:35:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:35:00,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:35:00,515 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 09:35:03,701 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-09 09:35:03,701 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-09 09:35:03,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:35:03,712 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-09 09:35:03,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:35:03 BoogieIcfgContainer [2021-11-09 09:35:03,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:35:03,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:35:03,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:35:03,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:35:03,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:34:59" (1/3) ... [2021-11-09 09:35:03,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532fd249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:35:03, skipping insertion in model container [2021-11-09 09:35:03,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:34:59" (2/3) ... [2021-11-09 09:35:03,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532fd249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:35:03, skipping insertion in model container [2021-11-09 09:35:03,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:35:03" (3/3) ... [2021-11-09 09:35:03,725 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2021-11-09 09:35:03,732 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:35:03,733 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 09:35:03,815 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:35:03,823 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 09:35:03,823 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-09 09:35:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-09 09:35:03,915 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:03,916 INFO L513 BasicCegarLoop]: 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] [2021-11-09 09:35:03,916 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:03,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1430118927, now seen corresponding path program 1 times [2021-11-09 09:35:03,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:03,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961460061] [2021-11-09 09:35:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:03,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:04,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:04,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961460061] [2021-11-09 09:35:04,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961460061] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:04,401 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:04,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:04,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992166860] [2021-11-09 09:35:04,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:04,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:04,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:04,434 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:07,192 INFO L93 Difference]: Finished difference Result 315 states and 530 transitions. [2021-11-09 09:35:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:07,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-09 09:35:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:07,209 INFO L225 Difference]: With dead ends: 315 [2021-11-09 09:35:07,209 INFO L226 Difference]: Without dead ends: 160 [2021-11-09 09:35:07,213 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-09 09:35:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-11-09 09:35:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 142 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2021-11-09 09:35:07,270 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 47 [2021-11-09 09:35:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:07,271 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2021-11-09 09:35:07,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2021-11-09 09:35:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-09 09:35:07,276 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:07,276 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:07,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 09:35:07,277 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1861384675, now seen corresponding path program 1 times [2021-11-09 09:35:07,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:07,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329465630] [2021-11-09 09:35:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:07,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:07,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:07,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329465630] [2021-11-09 09:35:07,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329465630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:07,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:07,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:07,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138004239] [2021-11-09 09:35:07,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:07,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:07,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:07,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:07,474 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:09,956 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2021-11-09 09:35:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:09,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-11-09 09:35:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:09,962 INFO L225 Difference]: With dead ends: 282 [2021-11-09 09:35:09,962 INFO L226 Difference]: Without dead ends: 160 [2021-11-09 09:35:09,964 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-11-09 09:35:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-11-09 09:35:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2021-11-09 09:35:09,993 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 60 [2021-11-09 09:35:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:09,994 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2021-11-09 09:35:09,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2021-11-09 09:35:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-09 09:35:09,997 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:09,997 INFO L513 BasicCegarLoop]: 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] [2021-11-09 09:35:09,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 09:35:09,998 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:09,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:09,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2019107822, now seen corresponding path program 1 times [2021-11-09 09:35:09,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:09,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779397479] [2021-11-09 09:35:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:09,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:10,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:10,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779397479] [2021-11-09 09:35:10,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779397479] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:10,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:10,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:10,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394649312] [2021-11-09 09:35:10,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:10,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:10,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:10,113 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:12,482 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2021-11-09 09:35:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-09 09:35:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:12,484 INFO L225 Difference]: With dead ends: 281 [2021-11-09 09:35:12,484 INFO L226 Difference]: Without dead ends: 159 [2021-11-09 09:35:12,485 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:12,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-09 09:35:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2021-11-09 09:35:12,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.528169014084507) internal successors, (217), 142 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2021-11-09 09:35:12,498 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 61 [2021-11-09 09:35:12,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:12,498 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2021-11-09 09:35:12,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:12,498 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2021-11-09 09:35:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-09 09:35:12,501 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:12,501 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:12,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 09:35:12,501 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1437848702, now seen corresponding path program 1 times [2021-11-09 09:35:12,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:12,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827085396] [2021-11-09 09:35:12,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:12,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:12,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:12,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827085396] [2021-11-09 09:35:12,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827085396] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:12,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:12,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:12,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407463004] [2021-11-09 09:35:12,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:12,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:12,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:12,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:12,587 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:15,003 INFO L93 Difference]: Finished difference Result 281 states and 423 transitions. [2021-11-09 09:35:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:15,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-09 09:35:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:15,005 INFO L225 Difference]: With dead ends: 281 [2021-11-09 09:35:15,006 INFO L226 Difference]: Without dead ends: 159 [2021-11-09 09:35:15,006 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-09 09:35:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2021-11-09 09:35:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 142 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2021-11-09 09:35:15,027 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 61 [2021-11-09 09:35:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:15,029 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2021-11-09 09:35:15,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2021-11-09 09:35:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-09 09:35:15,037 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:15,037 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:15,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 09:35:15,038 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash 16682137, now seen corresponding path program 1 times [2021-11-09 09:35:15,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:15,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939690012] [2021-11-09 09:35:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:15,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:15,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:15,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939690012] [2021-11-09 09:35:15,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939690012] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:15,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:15,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:15,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913440262] [2021-11-09 09:35:15,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:15,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:15,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:15,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:15,180 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:17,566 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2021-11-09 09:35:17,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-09 09:35:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:17,568 INFO L225 Difference]: With dead ends: 280 [2021-11-09 09:35:17,568 INFO L226 Difference]: Without dead ends: 158 [2021-11-09 09:35:17,569 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-11-09 09:35:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2021-11-09 09:35:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 142 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2021-11-09 09:35:17,580 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 61 [2021-11-09 09:35:17,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:17,581 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2021-11-09 09:35:17,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2021-11-09 09:35:17,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-09 09:35:17,582 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:17,583 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:17,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 09:35:17,583 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash -932666023, now seen corresponding path program 1 times [2021-11-09 09:35:17,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:17,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350534782] [2021-11-09 09:35:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:17,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:17,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:17,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350534782] [2021-11-09 09:35:17,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350534782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:17,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:17,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:17,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324107636] [2021-11-09 09:35:17,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:17,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:17,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:17,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:17,662 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:20,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:20,026 INFO L93 Difference]: Finished difference Result 278 states and 418 transitions. [2021-11-09 09:35:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:20,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-09 09:35:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:20,027 INFO L225 Difference]: With dead ends: 278 [2021-11-09 09:35:20,027 INFO L226 Difference]: Without dead ends: 156 [2021-11-09 09:35:20,028 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-09 09:35:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-11-09 09:35:20,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5070422535211268) internal successors, (214), 142 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2021-11-09 09:35:20,035 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 61 [2021-11-09 09:35:20,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:20,035 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2021-11-09 09:35:20,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:20,035 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2021-11-09 09:35:20,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-09 09:35:20,036 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:20,037 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:20,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 09:35:20,037 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1300462214, now seen corresponding path program 1 times [2021-11-09 09:35:20,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:20,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20915819] [2021-11-09 09:35:20,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:20,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:20,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:20,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20915819] [2021-11-09 09:35:20,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20915819] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:20,104 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:20,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:20,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211952055] [2021-11-09 09:35:20,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:20,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:20,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:20,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:20,105 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:22,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:22,452 INFO L93 Difference]: Finished difference Result 278 states and 417 transitions. [2021-11-09 09:35:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:22,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-09 09:35:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:22,454 INFO L225 Difference]: With dead ends: 278 [2021-11-09 09:35:22,454 INFO L226 Difference]: Without dead ends: 156 [2021-11-09 09:35:22,454 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-09 09:35:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-11-09 09:35:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2021-11-09 09:35:22,461 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 62 [2021-11-09 09:35:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:22,461 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2021-11-09 09:35:22,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2021-11-09 09:35:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-09 09:35:22,462 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:22,463 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:22,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 09:35:22,463 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:22,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:22,464 INFO L85 PathProgramCache]: Analyzing trace with hash 249957895, now seen corresponding path program 1 times [2021-11-09 09:35:22,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:22,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363459728] [2021-11-09 09:35:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:22,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:22,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:22,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363459728] [2021-11-09 09:35:22,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363459728] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:22,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:22,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:22,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376269941] [2021-11-09 09:35:22,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:22,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:22,552 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:24,936 INFO L93 Difference]: Finished difference Result 278 states and 416 transitions. [2021-11-09 09:35:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:24,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-09 09:35:24,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:24,938 INFO L225 Difference]: With dead ends: 278 [2021-11-09 09:35:24,938 INFO L226 Difference]: Without dead ends: 156 [2021-11-09 09:35:24,939 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-11-09 09:35:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-11-09 09:35:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4929577464788732) internal successors, (212), 142 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:24,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2021-11-09 09:35:24,945 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 63 [2021-11-09 09:35:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:24,945 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2021-11-09 09:35:24,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2021-11-09 09:35:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-09 09:35:24,947 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:24,947 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:24,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 09:35:24,948 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2005265579, now seen corresponding path program 1 times [2021-11-09 09:35:24,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:24,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058924082] [2021-11-09 09:35:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:24,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:25,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:25,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058924082] [2021-11-09 09:35:25,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058924082] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:25,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:25,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:25,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927666149] [2021-11-09 09:35:25,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:25,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:25,017 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:27,348 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2021-11-09 09:35:27,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-09 09:35:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:27,350 INFO L225 Difference]: With dead ends: 268 [2021-11-09 09:35:27,350 INFO L226 Difference]: Without dead ends: 146 [2021-11-09 09:35:27,351 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:27,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-09 09:35:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2021-11-09 09:35:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4859154929577465) internal successors, (211), 142 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 211 transitions. [2021-11-09 09:35:27,356 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 211 transitions. Word has length 64 [2021-11-09 09:35:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:27,356 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 211 transitions. [2021-11-09 09:35:27,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2021-11-09 09:35:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-09 09:35:27,357 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:27,357 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:27,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 09:35:27,357 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:27,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:27,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1889550317, now seen corresponding path program 1 times [2021-11-09 09:35:27,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:27,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599564649] [2021-11-09 09:35:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:27,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:27,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:27,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599564649] [2021-11-09 09:35:27,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599564649] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:27,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:27,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:27,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928541798] [2021-11-09 09:35:27,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:27,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:27,435 INFO L87 Difference]: Start difference. First operand 143 states and 211 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:29,791 INFO L93 Difference]: Finished difference Result 309 states and 465 transitions. [2021-11-09 09:35:29,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:29,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-09 09:35:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:29,793 INFO L225 Difference]: With dead ends: 309 [2021-11-09 09:35:29,793 INFO L226 Difference]: Without dead ends: 187 [2021-11-09 09:35:29,794 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-09 09:35:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 165. [2021-11-09 09:35:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5182926829268293) internal successors, (249), 164 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2021-11-09 09:35:29,805 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 64 [2021-11-09 09:35:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:29,806 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2021-11-09 09:35:29,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2021-11-09 09:35:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-09 09:35:29,807 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:29,807 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:29,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 09:35:29,808 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:29,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:29,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1893437081, now seen corresponding path program 1 times [2021-11-09 09:35:29,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:29,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993409170] [2021-11-09 09:35:29,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:29,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:29,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:29,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993409170] [2021-11-09 09:35:29,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993409170] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:29,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:29,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:29,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258869921] [2021-11-09 09:35:29,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:29,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:29,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:29,884 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:32,175 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2021-11-09 09:35:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:32,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-09 09:35:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:32,177 INFO L225 Difference]: With dead ends: 331 [2021-11-09 09:35:32,177 INFO L226 Difference]: Without dead ends: 187 [2021-11-09 09:35:32,178 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-09 09:35:32,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 165. [2021-11-09 09:35:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2021-11-09 09:35:32,185 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 77 [2021-11-09 09:35:32,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:32,185 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2021-11-09 09:35:32,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2021-11-09 09:35:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-09 09:35:32,186 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:32,187 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:32,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 09:35:32,187 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1840502030, now seen corresponding path program 1 times [2021-11-09 09:35:32,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:32,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726658507] [2021-11-09 09:35:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:32,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:32,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:32,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726658507] [2021-11-09 09:35:32,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726658507] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:32,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:32,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:32,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026425951] [2021-11-09 09:35:32,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:32,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:32,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:32,251 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:34,567 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2021-11-09 09:35:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:34,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-09 09:35:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:34,569 INFO L225 Difference]: With dead ends: 330 [2021-11-09 09:35:34,569 INFO L226 Difference]: Without dead ends: 186 [2021-11-09 09:35:34,570 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-09 09:35:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-11-09 09:35:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2021-11-09 09:35:34,577 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 78 [2021-11-09 09:35:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:34,578 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2021-11-09 09:35:34,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2021-11-09 09:35:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-09 09:35:34,579 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:34,579 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:34,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 09:35:34,580 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1002491258, now seen corresponding path program 1 times [2021-11-09 09:35:34,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:34,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700679965] [2021-11-09 09:35:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:34,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:34,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:34,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700679965] [2021-11-09 09:35:34,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700679965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:34,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:34,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:34,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277452270] [2021-11-09 09:35:34,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:34,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:34,653 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:37,018 INFO L93 Difference]: Finished difference Result 330 states and 497 transitions. [2021-11-09 09:35:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-09 09:35:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:37,020 INFO L225 Difference]: With dead ends: 330 [2021-11-09 09:35:37,020 INFO L226 Difference]: Without dead ends: 186 [2021-11-09 09:35:37,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-09 09:35:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-11-09 09:35:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2021-11-09 09:35:37,026 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 78 [2021-11-09 09:35:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:37,027 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2021-11-09 09:35:37,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2021-11-09 09:35:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-09 09:35:37,029 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:37,029 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:37,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 09:35:37,030 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:37,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 452039581, now seen corresponding path program 1 times [2021-11-09 09:35:37,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:37,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606872475] [2021-11-09 09:35:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:37,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:37,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:37,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606872475] [2021-11-09 09:35:37,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606872475] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:37,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:37,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:37,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259960926] [2021-11-09 09:35:37,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:37,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:37,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:37,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:37,112 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:39,429 INFO L93 Difference]: Finished difference Result 329 states and 494 transitions. [2021-11-09 09:35:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-09 09:35:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:39,431 INFO L225 Difference]: With dead ends: 329 [2021-11-09 09:35:39,431 INFO L226 Difference]: Without dead ends: 185 [2021-11-09 09:35:39,432 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-11-09 09:35:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2021-11-09 09:35:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4939024390243902) internal successors, (245), 164 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2021-11-09 09:35:39,438 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 78 [2021-11-09 09:35:39,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:39,439 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2021-11-09 09:35:39,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2021-11-09 09:35:39,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-09 09:35:39,440 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:39,440 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:39,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 09:35:39,441 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:39,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:39,441 INFO L85 PathProgramCache]: Analyzing trace with hash -497308579, now seen corresponding path program 1 times [2021-11-09 09:35:39,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:39,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453681309] [2021-11-09 09:35:39,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:39,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:39,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:39,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453681309] [2021-11-09 09:35:39,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453681309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:39,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:39,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:39,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559360068] [2021-11-09 09:35:39,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:39,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:39,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:39,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:39,504 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:41,829 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2021-11-09 09:35:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:41,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-09 09:35:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:41,834 INFO L225 Difference]: With dead ends: 327 [2021-11-09 09:35:41,834 INFO L226 Difference]: Without dead ends: 183 [2021-11-09 09:35:41,834 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-09 09:35:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2021-11-09 09:35:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2021-11-09 09:35:41,843 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 78 [2021-11-09 09:35:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:41,844 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2021-11-09 09:35:41,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2021-11-09 09:35:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-09 09:35:41,845 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:41,845 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:41,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 09:35:41,846 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:41,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:41,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1911641090, now seen corresponding path program 1 times [2021-11-09 09:35:41,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:41,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154869754] [2021-11-09 09:35:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:41,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:41,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:41,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154869754] [2021-11-09 09:35:41,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154869754] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:41,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:41,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:41,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788709834] [2021-11-09 09:35:41,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:41,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:41,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:41,914 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:44,229 INFO L93 Difference]: Finished difference Result 327 states and 488 transitions. [2021-11-09 09:35:44,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:44,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-09 09:35:44,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:44,231 INFO L225 Difference]: With dead ends: 327 [2021-11-09 09:35:44,231 INFO L226 Difference]: Without dead ends: 183 [2021-11-09 09:35:44,232 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-09 09:35:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2021-11-09 09:35:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 164 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2021-11-09 09:35:44,238 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 79 [2021-11-09 09:35:44,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:44,238 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2021-11-09 09:35:44,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2021-11-09 09:35:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-09 09:35:44,240 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:44,240 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:44,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 09:35:44,240 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:44,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2016633867, now seen corresponding path program 1 times [2021-11-09 09:35:44,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:44,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757061946] [2021-11-09 09:35:44,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:44,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:44,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:44,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757061946] [2021-11-09 09:35:44,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757061946] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:44,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:44,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:44,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986027209] [2021-11-09 09:35:44,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:44,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:44,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:44,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:44,312 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:46,561 INFO L93 Difference]: Finished difference Result 327 states and 486 transitions. [2021-11-09 09:35:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:46,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-09 09:35:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:46,562 INFO L225 Difference]: With dead ends: 327 [2021-11-09 09:35:46,563 INFO L226 Difference]: Without dead ends: 183 [2021-11-09 09:35:46,563 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-11-09 09:35:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2021-11-09 09:35:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.475609756097561) internal successors, (242), 164 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2021-11-09 09:35:46,569 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 80 [2021-11-09 09:35:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:46,569 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2021-11-09 09:35:46,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2021-11-09 09:35:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-09 09:35:46,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:46,571 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:46,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 09:35:46,571 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 937645863, now seen corresponding path program 1 times [2021-11-09 09:35:46,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:46,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436861029] [2021-11-09 09:35:46,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:46,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:46,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:46,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436861029] [2021-11-09 09:35:46,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436861029] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:46,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:46,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:46,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554776588] [2021-11-09 09:35:46,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:46,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:46,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:46,631 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:48,924 INFO L93 Difference]: Finished difference Result 317 states and 471 transitions. [2021-11-09 09:35:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:48,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-09 09:35:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:48,926 INFO L225 Difference]: With dead ends: 317 [2021-11-09 09:35:48,926 INFO L226 Difference]: Without dead ends: 173 [2021-11-09 09:35:48,926 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-11-09 09:35:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2021-11-09 09:35:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 164 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2021-11-09 09:35:48,932 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 81 [2021-11-09 09:35:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:48,933 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2021-11-09 09:35:48,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2021-11-09 09:35:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-09 09:35:48,934 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:48,934 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:48,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 09:35:48,935 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash -617936825, now seen corresponding path program 1 times [2021-11-09 09:35:48,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:48,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548763142] [2021-11-09 09:35:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:48,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:35:49,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:49,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548763142] [2021-11-09 09:35:49,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548763142] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:49,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:49,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:49,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422206674] [2021-11-09 09:35:49,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:49,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:49,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:49,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:49,031 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:51,429 INFO L93 Difference]: Finished difference Result 405 states and 606 transitions. [2021-11-09 09:35:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:51,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-09 09:35:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:51,431 INFO L225 Difference]: With dead ends: 405 [2021-11-09 09:35:51,431 INFO L226 Difference]: Without dead ends: 261 [2021-11-09 09:35:51,431 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-11-09 09:35:51,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 208. [2021-11-09 09:35:51,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.541062801932367) internal successors, (319), 207 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2021-11-09 09:35:51,439 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 86 [2021-11-09 09:35:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:51,439 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2021-11-09 09:35:51,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2021-11-09 09:35:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-09 09:35:51,441 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:51,441 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:51,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 09:35:51,441 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:51,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1515330103, now seen corresponding path program 1 times [2021-11-09 09:35:51,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:51,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192217453] [2021-11-09 09:35:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:51,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:35:51,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:51,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192217453] [2021-11-09 09:35:51,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192217453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:51,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:51,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:51,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540470] [2021-11-09 09:35:51,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:51,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:51,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:51,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:51,515 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:53,877 INFO L93 Difference]: Finished difference Result 445 states and 690 transitions. [2021-11-09 09:35:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-09 09:35:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:53,879 INFO L225 Difference]: With dead ends: 445 [2021-11-09 09:35:53,879 INFO L226 Difference]: Without dead ends: 258 [2021-11-09 09:35:53,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-09 09:35:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 232. [2021-11-09 09:35:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5627705627705628) internal successors, (361), 231 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2021-11-09 09:35:53,887 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 86 [2021-11-09 09:35:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:53,887 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2021-11-09 09:35:53,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2021-11-09 09:35:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-09 09:35:53,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:53,889 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:53,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 09:35:53,890 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:53,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:53,890 INFO L85 PathProgramCache]: Analyzing trace with hash 682769125, now seen corresponding path program 1 times [2021-11-09 09:35:53,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:53,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914541645] [2021-11-09 09:35:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:53,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:35:53,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:53,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914541645] [2021-11-09 09:35:53,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914541645] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:53,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:53,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:53,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590522358] [2021-11-09 09:35:53,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:53,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:53,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:53,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:53,959 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:56,357 INFO L93 Difference]: Finished difference Result 496 states and 767 transitions. [2021-11-09 09:35:56,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:56,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-09 09:35:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:56,359 INFO L225 Difference]: With dead ends: 496 [2021-11-09 09:35:56,359 INFO L226 Difference]: Without dead ends: 285 [2021-11-09 09:35:56,360 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-11-09 09:35:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 232. [2021-11-09 09:35:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5584415584415585) internal successors, (360), 231 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2021-11-09 09:35:56,367 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 99 [2021-11-09 09:35:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:56,368 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2021-11-09 09:35:56,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2021-11-09 09:35:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-09 09:35:56,370 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:56,370 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:56,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 09:35:56,370 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:56,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash 723443875, now seen corresponding path program 1 times [2021-11-09 09:35:56,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:56,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173419342] [2021-11-09 09:35:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:56,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:35:56,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:56,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173419342] [2021-11-09 09:35:56,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173419342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:56,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:56,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:56,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739238208] [2021-11-09 09:35:56,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:56,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:56,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:56,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:56,450 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:58,747 INFO L93 Difference]: Finished difference Result 469 states and 729 transitions. [2021-11-09 09:35:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:58,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-09 09:35:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:58,750 INFO L225 Difference]: With dead ends: 469 [2021-11-09 09:35:58,750 INFO L226 Difference]: Without dead ends: 258 [2021-11-09 09:35:58,751 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-09 09:35:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 232. [2021-11-09 09:35:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5541125541125542) internal successors, (359), 231 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2021-11-09 09:35:58,758 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 99 [2021-11-09 09:35:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:58,758 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2021-11-09 09:35:58,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2021-11-09 09:35:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-09 09:35:58,760 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:58,760 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:58,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 09:35:58,760 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -716503002, now seen corresponding path program 1 times [2021-11-09 09:35:58,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:58,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401610799] [2021-11-09 09:35:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:58,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:35:58,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:58,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401610799] [2021-11-09 09:35:58,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401610799] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:58,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:58,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:58,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710610466] [2021-11-09 09:35:58,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:58,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:58,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:58,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:58,837 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:01,211 INFO L93 Difference]: Finished difference Result 495 states and 762 transitions. [2021-11-09 09:36:01,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:01,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-09 09:36:01,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:01,213 INFO L225 Difference]: With dead ends: 495 [2021-11-09 09:36:01,213 INFO L226 Difference]: Without dead ends: 284 [2021-11-09 09:36:01,214 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-09 09:36:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2021-11-09 09:36:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2021-11-09 09:36:01,222 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 100 [2021-11-09 09:36:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:01,223 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2021-11-09 09:36:01,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:01,223 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2021-11-09 09:36:01,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-09 09:36:01,224 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:01,224 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:01,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 09:36:01,225 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:01,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 121507770, now seen corresponding path program 1 times [2021-11-09 09:36:01,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:01,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619788950] [2021-11-09 09:36:01,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:01,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-11-09 09:36:01,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:01,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619788950] [2021-11-09 09:36:01,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619788950] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:01,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:01,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:36:01,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593050197] [2021-11-09 09:36:01,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:36:01,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:36:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:01,320 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:05,762 INFO L93 Difference]: Finished difference Result 464 states and 721 transitions. [2021-11-09 09:36:05,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:36:05,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-09 09:36:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:05,764 INFO L225 Difference]: With dead ends: 464 [2021-11-09 09:36:05,764 INFO L226 Difference]: Without dead ends: 253 [2021-11-09 09:36:05,765 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:36:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-09 09:36:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-11-09 09:36:05,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5298804780876494) internal successors, (384), 251 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 384 transitions. [2021-11-09 09:36:05,775 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 384 transitions. Word has length 100 [2021-11-09 09:36:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:05,775 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 384 transitions. [2021-11-09 09:36:05,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 384 transitions. [2021-11-09 09:36:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-09 09:36:05,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:05,777 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:05,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 09:36:05,777 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1576038609, now seen corresponding path program 1 times [2021-11-09 09:36:05,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:05,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123704856] [2021-11-09 09:36:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:05,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:05,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:05,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123704856] [2021-11-09 09:36:05,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123704856] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:05,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:05,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:05,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153336707] [2021-11-09 09:36:05,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:05,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:05,855 INFO L87 Difference]: Start difference. First operand 252 states and 384 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:08,239 INFO L93 Difference]: Finished difference Result 534 states and 810 transitions. [2021-11-09 09:36:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-09 09:36:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:08,241 INFO L225 Difference]: With dead ends: 534 [2021-11-09 09:36:08,241 INFO L226 Difference]: Without dead ends: 303 [2021-11-09 09:36:08,241 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:08,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-09 09:36:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 252. [2021-11-09 09:36:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5258964143426295) internal successors, (383), 251 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 383 transitions. [2021-11-09 09:36:08,251 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 383 transitions. Word has length 100 [2021-11-09 09:36:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:08,251 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 383 transitions. [2021-11-09 09:36:08,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 383 transitions. [2021-11-09 09:36:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-09 09:36:08,253 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:08,253 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:08,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 09:36:08,253 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:08,254 INFO L85 PathProgramCache]: Analyzing trace with hash 626690449, now seen corresponding path program 1 times [2021-11-09 09:36:08,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:08,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769935848] [2021-11-09 09:36:08,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:08,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:08,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:08,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769935848] [2021-11-09 09:36:08,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769935848] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:08,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:08,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:08,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613140103] [2021-11-09 09:36:08,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:08,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:08,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:08,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:08,329 INFO L87 Difference]: Start difference. First operand 252 states and 383 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:10,804 INFO L93 Difference]: Finished difference Result 532 states and 806 transitions. [2021-11-09 09:36:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:10,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-09 09:36:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:10,807 INFO L225 Difference]: With dead ends: 532 [2021-11-09 09:36:10,807 INFO L226 Difference]: Without dead ends: 301 [2021-11-09 09:36:10,808 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-09 09:36:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 252. [2021-11-09 09:36:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5219123505976095) internal successors, (382), 251 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2021-11-09 09:36:10,846 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 100 [2021-11-09 09:36:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:10,846 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2021-11-09 09:36:10,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2021-11-09 09:36:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-09 09:36:10,848 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:10,848 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:10,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-09 09:36:10,848 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1458011437, now seen corresponding path program 1 times [2021-11-09 09:36:10,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:10,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023617624] [2021-11-09 09:36:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:10,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:10,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:10,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023617624] [2021-11-09 09:36:10,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023617624] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:10,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:10,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:10,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876504946] [2021-11-09 09:36:10,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:10,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:10,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:10,927 INFO L87 Difference]: Start difference. First operand 252 states and 382 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:13,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:13,288 INFO L93 Difference]: Finished difference Result 507 states and 770 transitions. [2021-11-09 09:36:13,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:13,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-09 09:36:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:13,290 INFO L225 Difference]: With dead ends: 507 [2021-11-09 09:36:13,290 INFO L226 Difference]: Without dead ends: 276 [2021-11-09 09:36:13,291 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:13,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-11-09 09:36:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 252. [2021-11-09 09:36:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 381 transitions. [2021-11-09 09:36:13,299 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 381 transitions. Word has length 100 [2021-11-09 09:36:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:13,300 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 381 transitions. [2021-11-09 09:36:13,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 381 transitions. [2021-11-09 09:36:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-09 09:36:13,303 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:13,304 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:13,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-09 09:36:13,304 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1887607699, now seen corresponding path program 1 times [2021-11-09 09:36:13,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:13,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370360970] [2021-11-09 09:36:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:13,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:13,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:13,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370360970] [2021-11-09 09:36:13,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370360970] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:13,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:13,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:13,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269508877] [2021-11-09 09:36:13,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:13,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:13,374 INFO L87 Difference]: Start difference. First operand 252 states and 381 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:15,670 INFO L93 Difference]: Finished difference Result 505 states and 766 transitions. [2021-11-09 09:36:15,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:15,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-09 09:36:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:15,672 INFO L225 Difference]: With dead ends: 505 [2021-11-09 09:36:15,672 INFO L226 Difference]: Without dead ends: 274 [2021-11-09 09:36:15,673 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-11-09 09:36:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 252. [2021-11-09 09:36:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5139442231075697) internal successors, (380), 251 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2021-11-09 09:36:15,682 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 100 [2021-11-09 09:36:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:15,683 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2021-11-09 09:36:15,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2021-11-09 09:36:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-09 09:36:15,684 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:15,685 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:15,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-09 09:36:15,685 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:15,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1026799039, now seen corresponding path program 1 times [2021-11-09 09:36:15,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:15,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794332694] [2021-11-09 09:36:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:15,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:15,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:15,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794332694] [2021-11-09 09:36:15,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794332694] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:15,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:15,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:15,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389089241] [2021-11-09 09:36:15,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:15,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:15,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:15,764 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:18,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:18,297 INFO L93 Difference]: Finished difference Result 532 states and 800 transitions. [2021-11-09 09:36:18,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:18,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-09 09:36:18,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:18,300 INFO L225 Difference]: With dead ends: 532 [2021-11-09 09:36:18,300 INFO L226 Difference]: Without dead ends: 301 [2021-11-09 09:36:18,301 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-09 09:36:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 252. [2021-11-09 09:36:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5099601593625498) internal successors, (379), 251 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2021-11-09 09:36:18,311 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 101 [2021-11-09 09:36:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:18,311 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2021-11-09 09:36:18,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2021-11-09 09:36:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-09 09:36:18,312 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:18,313 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:18,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-09 09:36:18,313 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:18,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash -593069953, now seen corresponding path program 1 times [2021-11-09 09:36:18,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:18,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344281651] [2021-11-09 09:36:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:18,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:18,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:18,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344281651] [2021-11-09 09:36:18,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344281651] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:18,399 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:18,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:18,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966856946] [2021-11-09 09:36:18,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:18,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:18,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:18,401 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:20,800 INFO L93 Difference]: Finished difference Result 505 states and 762 transitions. [2021-11-09 09:36:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-09 09:36:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:20,802 INFO L225 Difference]: With dead ends: 505 [2021-11-09 09:36:20,802 INFO L226 Difference]: Without dead ends: 274 [2021-11-09 09:36:20,803 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-11-09 09:36:20,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 252. [2021-11-09 09:36:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5059760956175299) internal successors, (378), 251 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2021-11-09 09:36:20,812 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 101 [2021-11-09 09:36:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:20,812 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2021-11-09 09:36:20,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2021-11-09 09:36:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-09 09:36:20,813 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:20,813 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:20,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-09 09:36:20,814 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:20,814 INFO L85 PathProgramCache]: Analyzing trace with hash 759033645, now seen corresponding path program 1 times [2021-11-09 09:36:20,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:20,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209741017] [2021-11-09 09:36:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:20,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:20,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:20,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209741017] [2021-11-09 09:36:20,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209741017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:20,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:20,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:20,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874790583] [2021-11-09 09:36:20,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:20,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:20,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:20,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:20,884 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:23,429 INFO L93 Difference]: Finished difference Result 532 states and 796 transitions. [2021-11-09 09:36:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:23,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-11-09 09:36:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:23,432 INFO L225 Difference]: With dead ends: 532 [2021-11-09 09:36:23,432 INFO L226 Difference]: Without dead ends: 301 [2021-11-09 09:36:23,433 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-09 09:36:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 252. [2021-11-09 09:36:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:23,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2021-11-09 09:36:23,474 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 102 [2021-11-09 09:36:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:23,475 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2021-11-09 09:36:23,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2021-11-09 09:36:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-09 09:36:23,476 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:23,476 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:23,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-09 09:36:23,477 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:23,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:23,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1319733423, now seen corresponding path program 1 times [2021-11-09 09:36:23,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:23,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285729314] [2021-11-09 09:36:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:23,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:23,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:23,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285729314] [2021-11-09 09:36:23,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285729314] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:23,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:23,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:23,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218314328] [2021-11-09 09:36:23,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:23,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:23,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:23,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:23,563 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:25,919 INFO L93 Difference]: Finished difference Result 505 states and 758 transitions. [2021-11-09 09:36:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:25,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-11-09 09:36:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:25,925 INFO L225 Difference]: With dead ends: 505 [2021-11-09 09:36:25,925 INFO L226 Difference]: Without dead ends: 274 [2021-11-09 09:36:25,927 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-11-09 09:36:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 252. [2021-11-09 09:36:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2021-11-09 09:36:25,941 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 102 [2021-11-09 09:36:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:25,941 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2021-11-09 09:36:25,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2021-11-09 09:36:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-09 09:36:25,943 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:25,943 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:25,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-09 09:36:25,943 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash -917428644, now seen corresponding path program 1 times [2021-11-09 09:36:25,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:25,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022685594] [2021-11-09 09:36:25,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:25,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:26,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:26,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022685594] [2021-11-09 09:36:26,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022685594] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:26,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:26,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:26,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063541118] [2021-11-09 09:36:26,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:26,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:26,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:26,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:26,042 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:28,594 INFO L93 Difference]: Finished difference Result 532 states and 792 transitions. [2021-11-09 09:36:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:28,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-09 09:36:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:28,597 INFO L225 Difference]: With dead ends: 532 [2021-11-09 09:36:28,597 INFO L226 Difference]: Without dead ends: 301 [2021-11-09 09:36:28,598 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-09 09:36:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 252. [2021-11-09 09:36:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4940239043824701) internal successors, (375), 251 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2021-11-09 09:36:28,609 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 103 [2021-11-09 09:36:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:28,609 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2021-11-09 09:36:28,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2021-11-09 09:36:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-09 09:36:28,611 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:28,612 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:28,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-09 09:36:28,612 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash -715604710, now seen corresponding path program 1 times [2021-11-09 09:36:28,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:28,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999141648] [2021-11-09 09:36:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:28,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:28,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:28,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999141648] [2021-11-09 09:36:28,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999141648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:28,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:28,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:28,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509880893] [2021-11-09 09:36:28,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:28,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:28,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:28,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:28,718 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:31,073 INFO L93 Difference]: Finished difference Result 505 states and 754 transitions. [2021-11-09 09:36:31,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:31,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-09 09:36:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:31,076 INFO L225 Difference]: With dead ends: 505 [2021-11-09 09:36:31,077 INFO L226 Difference]: Without dead ends: 274 [2021-11-09 09:36:31,077 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-11-09 09:36:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 252. [2021-11-09 09:36:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4900398406374502) internal successors, (374), 251 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2021-11-09 09:36:31,087 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 103 [2021-11-09 09:36:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:31,088 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2021-11-09 09:36:31,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2021-11-09 09:36:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-09 09:36:31,089 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:31,089 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:31,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-09 09:36:31,090 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1744114600, now seen corresponding path program 1 times [2021-11-09 09:36:31,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:31,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834686979] [2021-11-09 09:36:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:31,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:31,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:31,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834686979] [2021-11-09 09:36:31,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834686979] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:31,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:31,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:31,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017558379] [2021-11-09 09:36:31,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:31,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:31,174 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:33,650 INFO L93 Difference]: Finished difference Result 522 states and 776 transitions. [2021-11-09 09:36:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:33,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-09 09:36:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:33,652 INFO L225 Difference]: With dead ends: 522 [2021-11-09 09:36:33,652 INFO L226 Difference]: Without dead ends: 291 [2021-11-09 09:36:33,653 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-09 09:36:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2021-11-09 09:36:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2021-11-09 09:36:33,663 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 104 [2021-11-09 09:36:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:33,664 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2021-11-09 09:36:33,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2021-11-09 09:36:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-09 09:36:33,665 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:33,666 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:33,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-09 09:36:33,666 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash -589278038, now seen corresponding path program 1 times [2021-11-09 09:36:33,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:33,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936249300] [2021-11-09 09:36:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:33,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:33,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:33,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936249300] [2021-11-09 09:36:33,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936249300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:33,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:33,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:33,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891172770] [2021-11-09 09:36:33,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:33,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:33,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:33,749 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:36,059 INFO L93 Difference]: Finished difference Result 495 states and 738 transitions. [2021-11-09 09:36:36,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:36,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-09 09:36:36,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:36,061 INFO L225 Difference]: With dead ends: 495 [2021-11-09 09:36:36,061 INFO L226 Difference]: Without dead ends: 264 [2021-11-09 09:36:36,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-11-09 09:36:36,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 252. [2021-11-09 09:36:36,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4820717131474104) internal successors, (372), 251 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2021-11-09 09:36:36,070 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 104 [2021-11-09 09:36:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:36,071 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2021-11-09 09:36:36,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:36,071 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2021-11-09 09:36:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-09 09:36:36,072 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:36,073 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:36,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-09 09:36:36,073 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1868826641, now seen corresponding path program 1 times [2021-11-09 09:36:36,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:36,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910695414] [2021-11-09 09:36:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:36,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-09 09:36:36,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:36,147 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910695414] [2021-11-09 09:36:36,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910695414] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:36,148 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:36,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:36:36,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251995498] [2021-11-09 09:36:36,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:36,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:36,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:36,150 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:38,534 INFO L93 Difference]: Finished difference Result 522 states and 772 transitions. [2021-11-09 09:36:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:38,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-11-09 09:36:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:38,536 INFO L225 Difference]: With dead ends: 522 [2021-11-09 09:36:38,536 INFO L226 Difference]: Without dead ends: 291 [2021-11-09 09:36:38,537 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-09 09:36:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2021-11-09 09:36:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4780876494023905) internal successors, (371), 251 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2021-11-09 09:36:38,547 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 108 [2021-11-09 09:36:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:38,547 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2021-11-09 09:36:38,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2021-11-09 09:36:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-09 09:36:38,549 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:38,549 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:38,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-09 09:36:38,550 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash 739960817, now seen corresponding path program 1 times [2021-11-09 09:36:38,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:38,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274544708] [2021-11-09 09:36:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:38,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-09 09:36:38,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:38,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274544708] [2021-11-09 09:36:38,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274544708] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:38,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:38,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:36:38,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061143885] [2021-11-09 09:36:38,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:36:38,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:38,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:36:38,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:36:38,625 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:38,660 INFO L93 Difference]: Finished difference Result 710 states and 1060 transitions. [2021-11-09 09:36:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:36:38,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-11-09 09:36:38,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:38,664 INFO L225 Difference]: With dead ends: 710 [2021-11-09 09:36:38,665 INFO L226 Difference]: Without dead ends: 479 [2021-11-09 09:36:38,665 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:36:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-11-09 09:36:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2021-11-09 09:36:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 478 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 709 transitions. [2021-11-09 09:36:38,683 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 709 transitions. Word has length 108 [2021-11-09 09:36:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:38,684 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 709 transitions. [2021-11-09 09:36:38,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 709 transitions. [2021-11-09 09:36:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-09 09:36:38,686 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:38,686 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:38,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-09 09:36:38,687 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:38,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash -945850584, now seen corresponding path program 1 times [2021-11-09 09:36:38,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:38,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41208690] [2021-11-09 09:36:38,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:38,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-09 09:36:38,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:38,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41208690] [2021-11-09 09:36:38,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41208690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:38,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:38,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:36:38,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448919179] [2021-11-09 09:36:38,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:36:38,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:38,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:36:38,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:36:38,757 INFO L87 Difference]: Start difference. First operand 479 states and 709 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:38,790 INFO L93 Difference]: Finished difference Result 964 states and 1430 transitions. [2021-11-09 09:36:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:36:38,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-09 09:36:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:38,795 INFO L225 Difference]: With dead ends: 964 [2021-11-09 09:36:38,795 INFO L226 Difference]: Without dead ends: 506 [2021-11-09 09:36:38,797 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:36:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-11-09 09:36:38,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-11-09 09:36:38,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.4732673267326732) internal successors, (744), 505 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 744 transitions. [2021-11-09 09:36:38,818 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 744 transitions. Word has length 109 [2021-11-09 09:36:38,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:38,818 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 744 transitions. [2021-11-09 09:36:38,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,819 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 744 transitions. [2021-11-09 09:36:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-09 09:36:38,821 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:38,822 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:38,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-09 09:36:38,823 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:38,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1940544282, now seen corresponding path program 1 times [2021-11-09 09:36:38,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:38,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867944899] [2021-11-09 09:36:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:38,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-09 09:36:38,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:38,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867944899] [2021-11-09 09:36:38,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867944899] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:38,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:38,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:36:38,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916437822] [2021-11-09 09:36:38,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:36:38,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:38,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:36:38,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:36:38,880 INFO L87 Difference]: Start difference. First operand 506 states and 744 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:38,906 INFO L93 Difference]: Finished difference Result 993 states and 1466 transitions. [2021-11-09 09:36:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:36:38,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2021-11-09 09:36:38,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:38,910 INFO L225 Difference]: With dead ends: 993 [2021-11-09 09:36:38,910 INFO L226 Difference]: Without dead ends: 508 [2021-11-09 09:36:38,911 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:36:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-11-09 09:36:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2021-11-09 09:36:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.4714003944773175) internal successors, (746), 507 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 746 transitions. [2021-11-09 09:36:38,932 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 746 transitions. Word has length 109 [2021-11-09 09:36:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:38,932 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 746 transitions. [2021-11-09 09:36:38,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:38,933 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 746 transitions. [2021-11-09 09:36:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-09 09:36:38,935 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:38,935 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:38,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-09 09:36:38,935 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:38,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1960687741, now seen corresponding path program 1 times [2021-11-09 09:36:38,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:38,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108531833] [2021-11-09 09:36:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:38,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-11-09 09:36:39,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:39,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108531833] [2021-11-09 09:36:39,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108531833] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:39,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:39,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:36:39,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18815790] [2021-11-09 09:36:39,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:36:39,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:36:39,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:36:39,293 INFO L87 Difference]: Start difference. First operand 508 states and 746 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:43,732 INFO L93 Difference]: Finished difference Result 1013 states and 1488 transitions. [2021-11-09 09:36:43,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:36:43,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-11-09 09:36:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:43,736 INFO L225 Difference]: With dead ends: 1013 [2021-11-09 09:36:43,736 INFO L226 Difference]: Without dead ends: 508 [2021-11-09 09:36:43,737 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:36:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-11-09 09:36:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2021-11-09 09:36:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.4694280078895463) internal successors, (745), 507 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 745 transitions. [2021-11-09 09:36:43,754 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 745 transitions. Word has length 127 [2021-11-09 09:36:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:43,755 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 745 transitions. [2021-11-09 09:36:43,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 745 transitions. [2021-11-09 09:36:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-09 09:36:43,757 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:43,757 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:43,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-09 09:36:43,758 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:43,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1254091135, now seen corresponding path program 1 times [2021-11-09 09:36:43,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:43,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109819876] [2021-11-09 09:36:43,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:43,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:36:44,093 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:36:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:36:44,516 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:36:44,516 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-09 09:36:44,517 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:36:44,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-09 09:36:44,523 INFO L731 BasicCegarLoop]: Path program 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] [2021-11-09 09:36:44,527 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:36:44,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:36:44 BoogieIcfgContainer [2021-11-09 09:36:44,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:36:44,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:36:44,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:36:44,683 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:36:44,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:35:03" (3/4) ... [2021-11-09 09:36:44,687 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-09 09:36:44,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:36:44,689 INFO L168 Benchmark]: Toolchain (without parser) took 105615.71 ms. Allocated memory was 96.5 MB in the beginning and 159.4 MB in the end (delta: 62.9 MB). Free memory was 50.8 MB in the beginning and 43.6 MB in the end (delta: 7.2 MB). Peak memory consumption was 70.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:44,689 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 96.5 MB. Free memory is still 69.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:36:44,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.40 ms. Allocated memory was 96.5 MB in the beginning and 121.6 MB in the end (delta: 25.2 MB). Free memory was 50.6 MB in the beginning and 70.1 MB in the end (delta: -19.5 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:44,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.68 ms. Allocated memory is still 121.6 MB. Free memory was 70.1 MB in the beginning and 94.6 MB in the end (delta: -24.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:44,690 INFO L168 Benchmark]: Boogie Preprocessor took 175.87 ms. Allocated memory is still 121.6 MB. Free memory was 94.6 MB in the beginning and 87.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:44,691 INFO L168 Benchmark]: RCFGBuilder took 3506.26 ms. Allocated memory is still 121.6 MB. Free memory was 87.8 MB in the beginning and 55.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 43.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:44,691 INFO L168 Benchmark]: TraceAbstraction took 100965.33 ms. Allocated memory was 121.6 MB in the beginning and 159.4 MB in the end (delta: 37.7 MB). Free memory was 55.1 MB in the beginning and 43.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:44,692 INFO L168 Benchmark]: Witness Printer took 4.38 ms. Allocated memory is still 159.4 MB. Free memory is still 43.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:36:44,694 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 96.5 MB. Free memory is still 69.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 762.40 ms. Allocated memory was 96.5 MB in the beginning and 121.6 MB in the end (delta: 25.2 MB). Free memory was 50.6 MB in the beginning and 70.1 MB in the end (delta: -19.5 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 193.68 ms. Allocated memory is still 121.6 MB. Free memory was 70.1 MB in the beginning and 94.6 MB in the end (delta: -24.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 175.87 ms. Allocated memory is still 121.6 MB. Free memory was 94.6 MB in the beginning and 87.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3506.26 ms. Allocated memory is still 121.6 MB. Free memory was 87.8 MB in the beginning and 55.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 43.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 100965.33 ms. Allocated memory was 121.6 MB in the beginning and 159.4 MB in the end (delta: 37.7 MB). Free memory was 55.1 MB in the beginning and 43.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 16.1 GB. * Witness Printer took 4.38 ms. Allocated memory is still 159.4 MB. Free memory is still 43.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1733]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={22:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [init=1, SSLv3_server_data={22:0}] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={22:0}] [L1161] EXPR s->cert VAL [init=1, SSLv3_server_data={22:0}] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={22:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [init=1, SSLv3_server_data={22:0}] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [init=1, SSLv3_server_data={22:0}] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={22:0}] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [init=1, SSLv3_server_data={22:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={22:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [init=1, SSLv3_server_data={22:0}] [L1382] COND FALSE !(ret <= 0) [L1387] s->hit VAL [init=1, SSLv3_server_data={22:0}] [L1387] COND TRUE s->hit [L1388] s->state = 8656 VAL [init=1, SSLv3_server_data={22:0}] [L1392] s->init_num = 0 VAL [init=1, SSLv3_server_data={22:0}] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={22:0}] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [init=1, SSLv3_server_data={22:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={22:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1260] COND TRUE s->state == 8656 [L1585] EXPR s->session [L1585] EXPR s->s3 [L1585] EXPR (s->s3)->tmp.new_cipher [L1585] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1586] COND FALSE !(! tmp___9) [L1592] ret = __VERIFIER_nondet_int() [L1593] COND TRUE blastFlag == 2 [L1594] blastFlag = 3 VAL [init=1, SSLv3_server_data={22:0}] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [init=1, SSLv3_server_data={22:0}] [L1605] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={22:0}] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={22:0}] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [init=1, SSLv3_server_data={22:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={22:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [init=1, SSLv3_server_data={22:0}] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={22:0}] [L1733] reach_error() VAL [init=1, SSLv3_server_data={22:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 100.7s, OverallIterations: 42, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 95.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7860 SDtfs, 2153 SDslu, 11556 SDs, 0 SdLazy, 7143 SolverSat, 347 SolverUnsat, 40 SolverUnknown, 0 SolverNotchecked, 90.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 83 SyntacticMatches, 29 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=40, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 41 MinimizatonAttempts, 951 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3711 NumberOfCodeBlocks, 3711 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3543 ConstructedInterpolants, 0 QuantifiedInterpolants, 9602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 1839/1839 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-09 09:36:44,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX --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 4863b1f1d4b898d74c0df74738b7a6c95d5e4b7b1780f99116ba75ba156137bf --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:36:47,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:36:47,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:36:47,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:36:47,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:36:47,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:36:47,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:36:47,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:36:47,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:36:47,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:36:47,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:36:47,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:36:47,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:36:47,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:36:47,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:36:47,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:36:47,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:36:47,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:36:47,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:36:47,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:36:47,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:36:47,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:36:47,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:36:47,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:36:47,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:36:47,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:36:47,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:36:47,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:36:47,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:36:47,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:36:47,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:36:47,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:36:47,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:36:47,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:36:47,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:36:47,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:36:47,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:36:47,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:36:47,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:36:47,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:36:47,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:36:47,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-09 09:36:47,519 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:36:47,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:36:47,520 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:36:47,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:36:47,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:36:47,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:36:47,524 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:36:47,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:36:47,524 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:36:47,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:36:47,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:36:47,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:36:47,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:36:47,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:36:47,527 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-09 09:36:47,528 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-09 09:36:47,528 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:36:47,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:36:47,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:36:47,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:36:47,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:36:47,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:36:47,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:36:47,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:36:47,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:36:47,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:36:47,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:36:47,531 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-09 09:36:47,532 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-09 09:36:47,532 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:36:47,532 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:36:47,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:36:47,533 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:36:47,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-09 09:36:47,534 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/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_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX 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 -> 4863b1f1d4b898d74c0df74738b7a6c95d5e4b7b1780f99116ba75ba156137bf [2021-11-09 09:36:47,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:36:47,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:36:48,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:36:48,004 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:36:48,005 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:36:48,007 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2021-11-09 09:36:48,097 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data/7da30165a/cb73796c764c4991acbc094febd1bff6/FLAGd72f2dd6b [2021-11-09 09:36:48,897 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:36:48,898 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c [2021-11-09 09:36:48,936 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data/7da30165a/cb73796c764c4991acbc094febd1bff6/FLAGd72f2dd6b [2021-11-09 09:36:49,120 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/data/7da30165a/cb73796c764c4991acbc094febd1bff6 [2021-11-09 09:36:49,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:36:49,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:36:49,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:36:49,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:36:49,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:36:49,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:36:49" (1/1) ... [2021-11-09 09:36:49,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2474f057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:49, skipping insertion in model container [2021-11-09 09:36:49,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:36:49" (1/1) ... [2021-11-09 09:36:49,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:36:49,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:36:49,783 WARN L228 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_d10df17c-513a-40c4-9ed3-b701978f147d/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2021-11-09 09:36:49,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:36:49,815 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:36:49,973 WARN L228 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_d10df17c-513a-40c4-9ed3-b701978f147d/sv-benchmarks/c/openssl/s3_srvr.blast.02.i.cil-1.c[72502,72515] [2021-11-09 09:36:49,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:36:50,008 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:36:50,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50 WrapperNode [2021-11-09 09:36:50,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:36:50,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:36:50,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:36:50,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:36:50,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:36:50,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:36:50,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:36:50,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:36:50,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:36:50,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:36:50,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:36:50,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:36:50,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (1/1) ... [2021-11-09 09:36:50,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:36:50,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:36:50,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:36:50,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:36:50,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-09 09:36:50,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-09 09:36:50,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:36:50,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-09 09:36:50,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-09 09:36:50,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-09 09:36:50,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:36:50,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:36:50,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-09 09:36:50,634 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 09:36:55,329 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-09 09:36:55,330 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-09 09:36:55,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:36:55,342 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-09 09:36:55,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:36:55 BoogieIcfgContainer [2021-11-09 09:36:55,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:36:55,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:36:55,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:36:55,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:36:55,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:36:49" (1/3) ... [2021-11-09 09:36:55,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64945256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:36:55, skipping insertion in model container [2021-11-09 09:36:55,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:50" (2/3) ... [2021-11-09 09:36:55,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64945256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:36:55, skipping insertion in model container [2021-11-09 09:36:55,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:36:55" (3/3) ... [2021-11-09 09:36:55,357 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2021-11-09 09:36:55,364 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:36:55,364 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 09:36:55,440 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:36:55,452 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 09:36:55,453 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-09 09:36:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:55,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-09 09:36:55,513 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:55,514 INFO L513 BasicCegarLoop]: 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] [2021-11-09 09:36:55,515 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1430118927, now seen corresponding path program 1 times [2021-11-09 09:36:55,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-09 09:36:55,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627266997] [2021-11-09 09:36:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:55,544 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-09 09:36:55,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat [2021-11-09 09:36:55,551 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-09 09:36:55,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-09 09:36:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:55,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 09:36:55,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:36:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:36:56,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-09 09:36:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:36:56,793 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-09 09:36:56,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627266997] [2021-11-09 09:36:56,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627266997] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:56,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:56,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-09 09:36:56,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110391214] [2021-11-09 09:36:56,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:56,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-09 09:36:56,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:56,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:56,823 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:56,987 INFO L93 Difference]: Finished difference Result 539 states and 915 transitions. [2021-11-09 09:36:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:56,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-09 09:36:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:57,008 INFO L225 Difference]: With dead ends: 539 [2021-11-09 09:36:57,008 INFO L226 Difference]: Without dead ends: 365 [2021-11-09 09:36:57,013 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-11-09 09:36:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-11-09 09:36:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.521978021978022) internal successors, (554), 364 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 554 transitions. [2021-11-09 09:36:57,093 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 554 transitions. Word has length 47 [2021-11-09 09:36:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:57,094 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 554 transitions. [2021-11-09 09:36:57,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 554 transitions. [2021-11-09 09:36:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-09 09:36:57,103 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:57,104 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:57,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-09 09:36:57,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 [2021-11-09 09:36:57,319 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1221146161, now seen corresponding path program 1 times [2021-11-09 09:36:57,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-09 09:36:57,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614676244] [2021-11-09 09:36:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:57,322 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-09 09:36:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat [2021-11-09 09:36:57,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-09 09:36:57,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-09 09:36:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:57,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-09 09:36:57,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:36:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:36:58,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-09 09:36:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:36:58,819 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-09 09:36:58,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614676244] [2021-11-09 09:36:58,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614676244] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:58,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:58,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-09 09:36:58,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035912758] [2021-11-09 09:36:58,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:36:58,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-09 09:36:58,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:36:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:58,824 INFO L87 Difference]: Start difference. First operand 365 states and 554 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:58,974 INFO L93 Difference]: Finished difference Result 835 states and 1274 transitions. [2021-11-09 09:36:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:36:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-11-09 09:36:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:58,981 INFO L225 Difference]: With dead ends: 835 [2021-11-09 09:36:58,981 INFO L226 Difference]: Without dead ends: 599 [2021-11-09 09:36:58,984 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:36:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-09 09:36:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2021-11-09 09:36:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.5183946488294315) internal successors, (908), 598 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 908 transitions. [2021-11-09 09:36:59,040 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 908 transitions. Word has length 105 [2021-11-09 09:36:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:59,041 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 908 transitions. [2021-11-09 09:36:59,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 908 transitions. [2021-11-09 09:36:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-09 09:36:59,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:59,049 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:59,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-09 09:36:59,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 [2021-11-09 09:36:59,257 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1960687741, now seen corresponding path program 1 times [2021-11-09 09:36:59,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-09 09:36:59,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501371103] [2021-11-09 09:36:59,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:59,267 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-09 09:36:59,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat [2021-11-09 09:36:59,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-09 09:36:59,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-09 09:36:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:59,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-09 09:36:59,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:36:59,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-09 09:36:59,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-09 09:37:00,068 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-11-09 09:37:00,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 22 [2021-11-09 09:37:00,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-09 09:37:00,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-09 09:37:00,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-09 09:37:00,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-11-09 09:37:00,244 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-09 09:37:00,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2021-11-09 09:37:00,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-09 09:37:00,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-09 09:37:00,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-09 09:37:00,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-09 09:37:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-11-09 09:37:00,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-09 09:37:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-11-09 09:37:01,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-09 09:37:01,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501371103] [2021-11-09 09:37:01,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501371103] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-09 09:37:01,896 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:37:01,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-09 09:37:01,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895548755] [2021-11-09 09:37:01,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:37:01,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-09 09:37:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:37:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:37:01,904 INFO L87 Difference]: Start difference. First operand 599 states and 908 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:37:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:37:15,282 INFO L93 Difference]: Finished difference Result 1195 states and 1812 transitions. [2021-11-09 09:37:15,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:37:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2021-11-09 09:37:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:37:15,294 INFO L225 Difference]: With dead ends: 1195 [2021-11-09 09:37:15,294 INFO L226 Difference]: Without dead ends: 599 [2021-11-09 09:37:15,296 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:37:15,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-09 09:37:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2021-11-09 09:37:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 1.5167224080267558) internal successors, (907), 598 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:37:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 907 transitions. [2021-11-09 09:37:15,344 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 907 transitions. Word has length 127 [2021-11-09 09:37:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:37:15,347 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 907 transitions. [2021-11-09 09:37:15,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:37:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 907 transitions. [2021-11-09 09:37:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-09 09:37:15,353 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:37:15,355 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:37:15,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-09 09:37:15,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 [2021-11-09 09:37:15,556 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:37:15,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:37:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1254091135, now seen corresponding path program 1 times [2021-11-09 09:37:15,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-09 09:37:15,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108442815] [2021-11-09 09:37:15,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:37:15,558 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-09 09:37:15,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat [2021-11-09 09:37:15,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-09 09:37:15,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-09 09:37:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:37:16,985 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:37:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:37:18,083 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-11-09 09:37:18,083 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-09 09:37:18,085 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:37:18,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-09 09:37:18,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 [2021-11-09 09:37:18,307 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-11-09 09:37:18,310 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:37:18,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:37:18 BoogieIcfgContainer [2021-11-09 09:37:18,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:37:18,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:37:18,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:37:18,476 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:37:18,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:36:55" (3/4) ... [2021-11-09 09:37:18,479 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-09 09:37:18,643 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 09:37:18,645 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:37:18,646 INFO L168 Benchmark]: Toolchain (without parser) took 29519.16 ms. Allocated memory was 58.7 MB in the beginning and 96.5 MB in the end (delta: 37.7 MB). Free memory was 34.5 MB in the beginning and 29.4 MB in the end (delta: 5.1 MB). Peak memory consumption was 42.5 MB. Max. memory is 16.1 GB. [2021-11-09 09:37:18,647 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 58.7 MB. Free memory was 40.1 MB in the beginning and 40.0 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:37:18,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 877.99 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.3 MB in the beginning and 47.8 MB in the end (delta: -13.4 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. [2021-11-09 09:37:18,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 134.29 ms. Allocated memory is still 71.3 MB. Free memory was 47.8 MB in the beginning and 43.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:37:18,648 INFO L168 Benchmark]: Boogie Preprocessor took 84.50 ms. Allocated memory is still 71.3 MB. Free memory was 43.1 MB in the beginning and 35.9 MB in the end (delta: 7.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:37:18,649 INFO L168 Benchmark]: RCFGBuilder took 5115.62 ms. Allocated memory was 71.3 MB in the beginning and 96.5 MB in the end (delta: 25.2 MB). Free memory was 35.9 MB in the beginning and 65.3 MB in the end (delta: -29.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 16.1 GB. [2021-11-09 09:37:18,650 INFO L168 Benchmark]: TraceAbstraction took 23127.23 ms. Allocated memory is still 96.5 MB. Free memory was 64.5 MB in the beginning and 44.2 MB in the end (delta: 20.3 MB). Peak memory consumption was 38.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:37:18,651 INFO L168 Benchmark]: Witness Printer took 169.96 ms. Allocated memory is still 96.5 MB. Free memory was 44.2 MB in the beginning and 29.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-09 09:37:18,654 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 58.7 MB. Free memory was 40.1 MB in the beginning and 40.0 MB in the end (delta: 44.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 877.99 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 34.3 MB in the beginning and 47.8 MB in the end (delta: -13.4 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 134.29 ms. Allocated memory is still 71.3 MB. Free memory was 47.8 MB in the beginning and 43.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.50 ms. Allocated memory is still 71.3 MB. Free memory was 43.1 MB in the beginning and 35.9 MB in the end (delta: 7.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5115.62 ms. Allocated memory was 71.3 MB in the beginning and 96.5 MB in the end (delta: 25.2 MB). Free memory was 35.9 MB in the beginning and 65.3 MB in the end (delta: -29.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23127.23 ms. Allocated memory is still 96.5 MB. Free memory was 64.5 MB in the beginning and 44.2 MB in the end (delta: 20.3 MB). Peak memory consumption was 38.4 MB. Max. memory is 16.1 GB. * Witness Printer took 169.96 ms. Allocated memory is still 96.5 MB. Free memory was 44.2 MB in the beginning and 29.4 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1733]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1161] EXPR s->cert VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1382] COND FALSE !(ret <= 0) [L1387] s->hit VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1387] COND TRUE s->hit [L1388] s->state = 8656 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1392] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1260] COND TRUE s->state == 8656 [L1585] EXPR s->session [L1585] EXPR s->s3 [L1585] EXPR (s->s3)->tmp.new_cipher [L1585] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1586] COND FALSE !(! tmp___9) [L1592] ret = __VERIFIER_nondet_int() [L1593] COND TRUE blastFlag == 2 [L1594] blastFlag = 3 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1605] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1167] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1733] reach_error() VAL [init=1, SSLv3_server_data={-1073741793:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 790 SDtfs, 664 SDslu, 1671 SDs, 0 SdLazy, 378 SolverSat, 20 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 12.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 541 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=599occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 552 ConstructedInterpolants, 1 QuantifiedInterpolants, 1163 SizeOfPredicates, 12 NumberOfNonLiveVariables, 792 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 322/322 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-09 09:37:18,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d10df17c-513a-40c4-9ed3-b701978f147d/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE