./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt --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 9aa9ee37cd3362e609678719aa2feba1ed8c3980 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt --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 9aa9ee37cd3362e609678719aa2feba1ed8c3980 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:10:54,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:10:54,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:10:54,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:10:54,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:10:54,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:10:54,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:10:54,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:10:54,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:10:54,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:10:54,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:10:54,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:10:54,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:10:54,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:10:54,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:10:54,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:10:54,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:10:54,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:10:54,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:10:54,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:10:54,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:10:54,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:10:54,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:10:54,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:10:54,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:10:54,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:10:54,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:10:54,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:10:54,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:10:54,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:10:54,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:10:54,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:10:54,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:10:54,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:10:54,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:10:54,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:10:54,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:10:54,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:10:54,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:10:54,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:10:54,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:10:54,366 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:10:54,391 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:10:54,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:10:54,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:10:54,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:10:54,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:10:54,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:10:54,393 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:10:54,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:10:54,393 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:10:54,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:10:54,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:10:54,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:10:54,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:10:54,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:10:54,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:10:54,395 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:10:54,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:10:54,395 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:10:54,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:10:54,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:10:54,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:10:54,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:10:54,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:10:54,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:10:54,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:10:54,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:10:54,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:10:54,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:10:54,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:10:54,397 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:10:54,398 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_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/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_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt 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 -> 9aa9ee37cd3362e609678719aa2feba1ed8c3980 [2021-10-13 00:10:54,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:10:54,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:10:54,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:10:54,749 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:10:54,750 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:10:54,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2021-10-13 00:10:54,818 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data/6fe24e652/f960f23ca1b74aee955d1de962dad3d2/FLAG85d29f1fc [2021-10-13 00:10:55,543 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:10:55,545 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2021-10-13 00:10:55,564 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data/6fe24e652/f960f23ca1b74aee955d1de962dad3d2/FLAG85d29f1fc [2021-10-13 00:10:55,721 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data/6fe24e652/f960f23ca1b74aee955d1de962dad3d2 [2021-10-13 00:10:55,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:10:55,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:10:55,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:10:55,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:10:55,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:10:55,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:10:55" (1/1) ... [2021-10-13 00:10:55,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f746a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:55, skipping insertion in model container [2021-10-13 00:10:55,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:10:55" (1/1) ... [2021-10-13 00:10:55,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:10:55,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:10:56,216 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_420acd97-1e10-4bec-be35-8ff24108a658/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[72022,72035] [2021-10-13 00:10:56,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:10:56,243 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:10:56,439 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_420acd97-1e10-4bec-be35-8ff24108a658/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[72022,72035] [2021-10-13 00:10:56,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:10:56,462 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:10:56,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56 WrapperNode [2021-10-13 00:10:56,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:10:56,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:10:56,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:10:56,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:10:56,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:10:56,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:10:56,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:10:56,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:10:56,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:10:56,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:10:56,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:10:56,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:10:56,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (1/1) ... [2021-10-13 00:10:56,730 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:10:56,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:10:56,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:10:56,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:10:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 00:10:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:10:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:10:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 00:10:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 00:10:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:10:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 00:10:56,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:10:56,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:10:57,028 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:11:00,041 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-13 00:11:00,042 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-13 00:11:00,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:11:00,050 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 00:11:00,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:00 BoogieIcfgContainer [2021-10-13 00:11:00,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:11:00,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:11:00,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:11:00,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:11:00,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:10:55" (1/3) ... [2021-10-13 00:11:00,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fb32d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:11:00, skipping insertion in model container [2021-10-13 00:11:00,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:10:56" (2/3) ... [2021-10-13 00:11:00,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fb32d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:11:00, skipping insertion in model container [2021-10-13 00:11:00,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:00" (3/3) ... [2021-10-13 00:11:00,060 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2021-10-13 00:11:00,065 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:11:00,066 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 00:11:00,110 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:11:00,116 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, mConcurrency=FINITE_AUTOMATA, 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-10-13 00:11:00,116 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 00:11:00,134 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-10-13 00:11:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 00:11:00,159 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:00,160 INFO L512 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-10-13 00:11:00,160 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:00,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:00,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1430118927, now seen corresponding path program 1 times [2021-10-13 00:11:00,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:00,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402419326] [2021-10-13 00:11:00,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:00,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:00,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:00,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402419326] [2021-10-13 00:11:00,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402419326] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:00,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:00,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:00,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295922117] [2021-10-13 00:11:00,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:00,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:00,682 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-10-13 00:11:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:03,184 INFO L93 Difference]: Finished difference Result 315 states and 530 transitions. [2021-10-13 00:11:03,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:03,186 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-10-13 00:11:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:03,197 INFO L225 Difference]: With dead ends: 315 [2021-10-13 00:11:03,197 INFO L226 Difference]: Without dead ends: 160 [2021-10-13 00:11:03,203 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-10-13 00:11:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-10-13 00:11:03,248 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-10-13 00:11:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2021-10-13 00:11:03,251 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 47 [2021-10-13 00:11:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:03,251 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2021-10-13 00:11:03,251 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-10-13 00:11:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2021-10-13 00:11:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-13 00:11:03,255 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:03,255 INFO L512 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-10-13 00:11:03,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:11:03,255 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:03,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:03,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1861384675, now seen corresponding path program 1 times [2021-10-13 00:11:03,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:03,257 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683693858] [2021-10-13 00:11:03,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:03,257 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:03,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:03,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683693858] [2021-10-13 00:11:03,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683693858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:03,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:03,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:03,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207640733] [2021-10-13 00:11:03,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:03,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:03,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:03,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:03,494 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-10-13 00:11:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:05,893 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2021-10-13 00:11:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:05,894 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-10-13 00:11:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:05,896 INFO L225 Difference]: With dead ends: 282 [2021-10-13 00:11:05,896 INFO L226 Difference]: Without dead ends: 160 [2021-10-13 00:11:05,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:05,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-10-13 00:11:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-10-13 00:11:05,919 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-10-13 00:11:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2021-10-13 00:11:05,921 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 60 [2021-10-13 00:11:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:05,923 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2021-10-13 00:11:05,923 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-10-13 00:11:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2021-10-13 00:11:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 00:11:05,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:05,931 INFO L512 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-10-13 00:11:05,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:11:05,932 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2019107822, now seen corresponding path program 1 times [2021-10-13 00:11:05,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:05,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112169378] [2021-10-13 00:11:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:05,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:06,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:06,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112169378] [2021-10-13 00:11:06,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112169378] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:06,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:06,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:06,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617108184] [2021-10-13 00:11:06,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:06,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:06,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:06,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:06,041 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-10-13 00:11:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:08,398 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2021-10-13 00:11:08,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:08,399 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-10-13 00:11:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:08,401 INFO L225 Difference]: With dead ends: 281 [2021-10-13 00:11:08,401 INFO L226 Difference]: Without dead ends: 159 [2021-10-13 00:11:08,402 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-10-13 00:11:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2021-10-13 00:11:08,412 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-10-13 00:11:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2021-10-13 00:11:08,413 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 61 [2021-10-13 00:11:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:08,413 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2021-10-13 00:11:08,413 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-10-13 00:11:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2021-10-13 00:11:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 00:11:08,416 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:08,416 INFO L512 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-10-13 00:11:08,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:11:08,416 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1437848702, now seen corresponding path program 1 times [2021-10-13 00:11:08,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:08,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100414106] [2021-10-13 00:11:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:08,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:08,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:08,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100414106] [2021-10-13 00:11:08,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100414106] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:08,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:08,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:08,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144554746] [2021-10-13 00:11:08,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:08,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:08,498 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-10-13 00:11:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:10,879 INFO L93 Difference]: Finished difference Result 281 states and 423 transitions. [2021-10-13 00:11:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:10,880 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-10-13 00:11:10,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:10,881 INFO L225 Difference]: With dead ends: 281 [2021-10-13 00:11:10,881 INFO L226 Difference]: Without dead ends: 159 [2021-10-13 00:11:10,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-10-13 00:11:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2021-10-13 00:11:10,891 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-10-13 00:11:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2021-10-13 00:11:10,892 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 61 [2021-10-13 00:11:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:10,892 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2021-10-13 00:11:10,893 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-10-13 00:11:10,893 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2021-10-13 00:11:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 00:11:10,894 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:10,894 INFO L512 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-10-13 00:11:10,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:11:10,895 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:10,896 INFO L82 PathProgramCache]: Analyzing trace with hash 16682137, now seen corresponding path program 1 times [2021-10-13 00:11:10,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:10,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636113484] [2021-10-13 00:11:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:10,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:10,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:10,979 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636113484] [2021-10-13 00:11:10,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636113484] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:10,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:10,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:10,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583009400] [2021-10-13 00:11:10,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:10,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:10,982 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-10-13 00:11:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:13,299 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2021-10-13 00:11:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:13,300 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-10-13 00:11:13,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:13,302 INFO L225 Difference]: With dead ends: 280 [2021-10-13 00:11:13,302 INFO L226 Difference]: Without dead ends: 158 [2021-10-13 00:11:13,302 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-13 00:11:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2021-10-13 00:11:13,308 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-10-13 00:11:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2021-10-13 00:11:13,309 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 61 [2021-10-13 00:11:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:13,310 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2021-10-13 00:11:13,310 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-10-13 00:11:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2021-10-13 00:11:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 00:11:13,315 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:13,315 INFO L512 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-10-13 00:11:13,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:11:13,315 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash -932666023, now seen corresponding path program 1 times [2021-10-13 00:11:13,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:13,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415311527] [2021-10-13 00:11:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:13,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:13,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:13,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415311527] [2021-10-13 00:11:13,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415311527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:13,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:13,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:13,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796960655] [2021-10-13 00:11:13,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:13,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:13,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:13,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:13,417 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-10-13 00:11:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:15,732 INFO L93 Difference]: Finished difference Result 278 states and 418 transitions. [2021-10-13 00:11:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:15,733 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-10-13 00:11:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:15,735 INFO L225 Difference]: With dead ends: 278 [2021-10-13 00:11:15,735 INFO L226 Difference]: Without dead ends: 156 [2021-10-13 00:11:15,735 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-13 00:11:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-10-13 00:11:15,741 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-10-13 00:11:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2021-10-13 00:11:15,742 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 61 [2021-10-13 00:11:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:15,742 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2021-10-13 00:11:15,742 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-10-13 00:11:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2021-10-13 00:11:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 00:11:15,743 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:15,744 INFO L512 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-10-13 00:11:15,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:11:15,744 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:15,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1300462214, now seen corresponding path program 1 times [2021-10-13 00:11:15,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:15,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836977973] [2021-10-13 00:11:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:15,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:15,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:15,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836977973] [2021-10-13 00:11:15,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836977973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:15,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:15,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:15,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109033637] [2021-10-13 00:11:15,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:15,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:15,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:15,855 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-10-13 00:11:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:18,170 INFO L93 Difference]: Finished difference Result 278 states and 417 transitions. [2021-10-13 00:11:18,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:18,171 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-10-13 00:11:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:18,172 INFO L225 Difference]: With dead ends: 278 [2021-10-13 00:11:18,172 INFO L226 Difference]: Without dead ends: 156 [2021-10-13 00:11:18,173 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-13 00:11:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-10-13 00:11:18,178 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-10-13 00:11:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2021-10-13 00:11:18,179 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 62 [2021-10-13 00:11:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:18,179 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2021-10-13 00:11:18,179 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-10-13 00:11:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2021-10-13 00:11:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 00:11:18,180 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:18,181 INFO L512 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-10-13 00:11:18,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:11:18,181 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash 249957895, now seen corresponding path program 1 times [2021-10-13 00:11:18,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:18,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876531580] [2021-10-13 00:11:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:18,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:18,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:18,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876531580] [2021-10-13 00:11:18,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876531580] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:18,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:18,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:18,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985121846] [2021-10-13 00:11:18,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:18,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:18,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:18,304 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-10-13 00:11:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:20,613 INFO L93 Difference]: Finished difference Result 278 states and 416 transitions. [2021-10-13 00:11:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:20,613 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-10-13 00:11:20,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:20,615 INFO L225 Difference]: With dead ends: 278 [2021-10-13 00:11:20,615 INFO L226 Difference]: Without dead ends: 156 [2021-10-13 00:11:20,615 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:20,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-13 00:11:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-10-13 00:11:20,620 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-10-13 00:11:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2021-10-13 00:11:20,621 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 63 [2021-10-13 00:11:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:20,621 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2021-10-13 00:11:20,621 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-10-13 00:11:20,621 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2021-10-13 00:11:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-13 00:11:20,622 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:20,622 INFO L512 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-10-13 00:11:20,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:11:20,623 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:20,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:20,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2005265579, now seen corresponding path program 1 times [2021-10-13 00:11:20,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:20,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075409912] [2021-10-13 00:11:20,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:20,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:20,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:20,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075409912] [2021-10-13 00:11:20,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075409912] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:20,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:20,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:20,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264375339] [2021-10-13 00:11:20,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:20,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:20,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:20,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:20,689 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-10-13 00:11:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:22,949 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2021-10-13 00:11:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:22,950 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-10-13 00:11:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:22,951 INFO L225 Difference]: With dead ends: 268 [2021-10-13 00:11:22,951 INFO L226 Difference]: Without dead ends: 146 [2021-10-13 00:11:22,952 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-13 00:11:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2021-10-13 00:11:22,956 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-10-13 00:11:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 211 transitions. [2021-10-13 00:11:22,956 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 211 transitions. Word has length 64 [2021-10-13 00:11:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:22,957 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 211 transitions. [2021-10-13 00:11:22,957 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-10-13 00:11:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2021-10-13 00:11:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-13 00:11:22,958 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:22,958 INFO L512 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-10-13 00:11:22,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:11:22,958 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1889550317, now seen corresponding path program 1 times [2021-10-13 00:11:22,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:22,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141352282] [2021-10-13 00:11:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:22,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:23,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:23,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141352282] [2021-10-13 00:11:23,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141352282] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:23,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:23,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:23,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114810672] [2021-10-13 00:11:23,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:23,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:23,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:23,031 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-10-13 00:11:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:25,317 INFO L93 Difference]: Finished difference Result 308 states and 463 transitions. [2021-10-13 00:11:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:25,317 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-10-13 00:11:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:25,319 INFO L225 Difference]: With dead ends: 308 [2021-10-13 00:11:25,319 INFO L226 Difference]: Without dead ends: 186 [2021-10-13 00:11:25,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-10-13 00:11:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-10-13 00:11:25,324 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-10-13 00:11:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2021-10-13 00:11:25,324 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 64 [2021-10-13 00:11:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:25,325 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2021-10-13 00:11:25,325 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-10-13 00:11:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2021-10-13 00:11:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-13 00:11:25,325 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:25,326 INFO L512 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-10-13 00:11:25,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:11:25,326 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1893437081, now seen corresponding path program 1 times [2021-10-13 00:11:25,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:25,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387589173] [2021-10-13 00:11:25,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:25,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:25,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:25,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387589173] [2021-10-13 00:11:25,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387589173] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:25,390 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:25,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:25,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488741402] [2021-10-13 00:11:25,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:25,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:25,392 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-10-13 00:11:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:27,744 INFO L93 Difference]: Finished difference Result 330 states and 500 transitions. [2021-10-13 00:11:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:27,745 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-10-13 00:11:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:27,746 INFO L225 Difference]: With dead ends: 330 [2021-10-13 00:11:27,747 INFO L226 Difference]: Without dead ends: 186 [2021-10-13 00:11:27,747 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-10-13 00:11:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-10-13 00:11:27,752 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-10-13 00:11:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2021-10-13 00:11:27,752 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 77 [2021-10-13 00:11:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:27,753 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2021-10-13 00:11:27,753 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-10-13 00:11:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2021-10-13 00:11:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 00:11:27,754 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:27,754 INFO L512 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-10-13 00:11:27,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:11:27,755 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:27,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:27,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1840502030, now seen corresponding path program 1 times [2021-10-13 00:11:27,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:27,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363188815] [2021-10-13 00:11:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:27,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:27,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:27,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363188815] [2021-10-13 00:11:27,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363188815] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:27,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:27,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:27,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596213101] [2021-10-13 00:11:27,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:27,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:27,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:27,812 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-10-13 00:11:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:30,088 INFO L93 Difference]: Finished difference Result 329 states and 497 transitions. [2021-10-13 00:11:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:30,088 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-10-13 00:11:30,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:30,090 INFO L225 Difference]: With dead ends: 329 [2021-10-13 00:11:30,090 INFO L226 Difference]: Without dead ends: 185 [2021-10-13 00:11:30,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-13 00:11:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2021-10-13 00:11:30,095 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-10-13 00:11:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2021-10-13 00:11:30,096 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 78 [2021-10-13 00:11:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:30,096 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2021-10-13 00:11:30,096 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-10-13 00:11:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2021-10-13 00:11:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 00:11:30,097 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:30,098 INFO L512 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-10-13 00:11:30,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:11:30,098 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1002491258, now seen corresponding path program 1 times [2021-10-13 00:11:30,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:30,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202282592] [2021-10-13 00:11:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:30,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:30,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:30,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202282592] [2021-10-13 00:11:30,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202282592] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:30,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:30,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:30,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924391281] [2021-10-13 00:11:30,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:30,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:30,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:30,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:30,155 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-10-13 00:11:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:32,430 INFO L93 Difference]: Finished difference Result 329 states and 495 transitions. [2021-10-13 00:11:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:32,431 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-10-13 00:11:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:32,432 INFO L225 Difference]: With dead ends: 329 [2021-10-13 00:11:32,433 INFO L226 Difference]: Without dead ends: 185 [2021-10-13 00:11:32,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-13 00:11:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2021-10-13 00:11:32,438 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-10-13 00:11:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2021-10-13 00:11:32,439 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 78 [2021-10-13 00:11:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:32,439 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2021-10-13 00:11:32,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-10-13 00:11:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2021-10-13 00:11:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 00:11:32,441 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:32,441 INFO L512 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-10-13 00:11:32,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:11:32,441 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:32,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:32,442 INFO L82 PathProgramCache]: Analyzing trace with hash 452039581, now seen corresponding path program 1 times [2021-10-13 00:11:32,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:32,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017622197] [2021-10-13 00:11:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:32,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:32,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:32,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017622197] [2021-10-13 00:11:32,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017622197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:32,502 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:32,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:32,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783773839] [2021-10-13 00:11:32,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:32,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:32,504 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-10-13 00:11:34,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:34,259 INFO L93 Difference]: Finished difference Result 328 states and 492 transitions. [2021-10-13 00:11:34,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:34,259 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-10-13 00:11:34,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:34,261 INFO L225 Difference]: With dead ends: 328 [2021-10-13 00:11:34,261 INFO L226 Difference]: Without dead ends: 184 [2021-10-13 00:11:34,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:34,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-10-13 00:11:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2021-10-13 00:11:34,266 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-10-13 00:11:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2021-10-13 00:11:34,267 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 78 [2021-10-13 00:11:34,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:34,267 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2021-10-13 00:11:34,267 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-10-13 00:11:34,267 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2021-10-13 00:11:34,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 00:11:34,268 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:34,268 INFO L512 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-10-13 00:11:34,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:11:34,268 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:34,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:34,269 INFO L82 PathProgramCache]: Analyzing trace with hash -497308579, now seen corresponding path program 1 times [2021-10-13 00:11:34,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:34,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035013776] [2021-10-13 00:11:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:34,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:34,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:34,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035013776] [2021-10-13 00:11:34,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035013776] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:34,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:34,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:34,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463328636] [2021-10-13 00:11:34,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:34,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:34,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:34,327 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-10-13 00:11:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:36,591 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2021-10-13 00:11:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:36,591 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-10-13 00:11:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:36,593 INFO L225 Difference]: With dead ends: 326 [2021-10-13 00:11:36,593 INFO L226 Difference]: Without dead ends: 182 [2021-10-13 00:11:36,593 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-13 00:11:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-10-13 00:11:36,598 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-10-13 00:11:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2021-10-13 00:11:36,599 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 78 [2021-10-13 00:11:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:36,599 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2021-10-13 00:11:36,599 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-10-13 00:11:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2021-10-13 00:11:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-13 00:11:36,600 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:36,600 INFO L512 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-10-13 00:11:36,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:11:36,601 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:36,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:36,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1911641090, now seen corresponding path program 1 times [2021-10-13 00:11:36,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:36,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681073938] [2021-10-13 00:11:36,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:36,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:36,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:36,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681073938] [2021-10-13 00:11:36,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681073938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:36,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:36,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:36,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769986807] [2021-10-13 00:11:36,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:36,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:36,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:36,657 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-10-13 00:11:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:38,909 INFO L93 Difference]: Finished difference Result 326 states and 486 transitions. [2021-10-13 00:11:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:38,910 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-10-13 00:11:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:38,911 INFO L225 Difference]: With dead ends: 326 [2021-10-13 00:11:38,911 INFO L226 Difference]: Without dead ends: 182 [2021-10-13 00:11:38,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:38,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-13 00:11:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-10-13 00:11:38,917 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-10-13 00:11:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2021-10-13 00:11:38,918 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 79 [2021-10-13 00:11:38,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:38,918 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2021-10-13 00:11:38,918 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-10-13 00:11:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2021-10-13 00:11:38,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-13 00:11:38,920 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:38,920 INFO L512 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-10-13 00:11:38,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:11:38,920 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:38,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:38,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2016633867, now seen corresponding path program 1 times [2021-10-13 00:11:38,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:38,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822578431] [2021-10-13 00:11:38,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:38,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:38,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:38,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822578431] [2021-10-13 00:11:38,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822578431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:38,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:38,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:38,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252559764] [2021-10-13 00:11:38,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:38,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:38,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:38,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:38,979 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-10-13 00:11:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:41,195 INFO L93 Difference]: Finished difference Result 326 states and 484 transitions. [2021-10-13 00:11:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:41,196 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-10-13 00:11:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:41,197 INFO L225 Difference]: With dead ends: 326 [2021-10-13 00:11:41,197 INFO L226 Difference]: Without dead ends: 182 [2021-10-13 00:11:41,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-13 00:11:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-10-13 00:11:41,202 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-10-13 00:11:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2021-10-13 00:11:41,203 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 80 [2021-10-13 00:11:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:41,203 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2021-10-13 00:11:41,204 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-10-13 00:11:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2021-10-13 00:11:41,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-10-13 00:11:41,205 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:41,205 INFO L512 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-10-13 00:11:41,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:11:41,205 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:41,206 INFO L82 PathProgramCache]: Analyzing trace with hash 937645863, now seen corresponding path program 1 times [2021-10-13 00:11:41,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:41,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530037324] [2021-10-13 00:11:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:41,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:11:41,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:41,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530037324] [2021-10-13 00:11:41,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530037324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:41,259 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:41,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:41,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083207183] [2021-10-13 00:11:41,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:41,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:41,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:41,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:41,261 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-10-13 00:11:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:43,504 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2021-10-13 00:11:43,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:43,504 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-10-13 00:11:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:43,506 INFO L225 Difference]: With dead ends: 316 [2021-10-13 00:11:43,506 INFO L226 Difference]: Without dead ends: 172 [2021-10-13 00:11:43,506 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:43,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-10-13 00:11:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2021-10-13 00:11:43,510 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-10-13 00:11:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2021-10-13 00:11:43,511 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 81 [2021-10-13 00:11:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:43,512 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2021-10-13 00:11:43,512 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-10-13 00:11:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2021-10-13 00:11:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-13 00:11:43,513 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:43,513 INFO L512 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-10-13 00:11:43,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:11:43,514 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:43,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:43,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1833682444, now seen corresponding path program 1 times [2021-10-13 00:11:43,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:43,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428294412] [2021-10-13 00:11:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:43,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:11:43,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:43,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428294412] [2021-10-13 00:11:43,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428294412] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:43,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:43,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:43,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677260532] [2021-10-13 00:11:43,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:43,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:43,612 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-10-13 00:11:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:45,945 INFO L93 Difference]: Finished difference Result 404 states and 604 transitions. [2021-10-13 00:11:45,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:45,946 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-10-13 00:11:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:45,948 INFO L225 Difference]: With dead ends: 404 [2021-10-13 00:11:45,948 INFO L226 Difference]: Without dead ends: 260 [2021-10-13 00:11:45,949 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-10-13 00:11:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 208. [2021-10-13 00:11:45,955 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-10-13 00:11:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2021-10-13 00:11:45,956 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 86 [2021-10-13 00:11:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:45,956 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2021-10-13 00:11:45,957 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-10-13 00:11:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2021-10-13 00:11:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-13 00:11:45,958 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:45,958 INFO L512 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-10-13 00:11:45,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:11:45,959 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:45,959 INFO L82 PathProgramCache]: Analyzing trace with hash 936289166, now seen corresponding path program 1 times [2021-10-13 00:11:45,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:45,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166406041] [2021-10-13 00:11:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:45,960 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:46,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-10-13 00:11:46,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:46,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166406041] [2021-10-13 00:11:46,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166406041] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:46,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:46,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:46,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545566612] [2021-10-13 00:11:46,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:46,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:46,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:46,030 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-10-13 00:11:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:48,391 INFO L93 Difference]: Finished difference Result 444 states and 688 transitions. [2021-10-13 00:11:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:48,392 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-10-13 00:11:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:48,394 INFO L225 Difference]: With dead ends: 444 [2021-10-13 00:11:48,394 INFO L226 Difference]: Without dead ends: 257 [2021-10-13 00:11:48,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-10-13 00:11:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2021-10-13 00:11:48,400 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-10-13 00:11:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2021-10-13 00:11:48,401 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 86 [2021-10-13 00:11:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:48,402 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2021-10-13 00:11:48,402 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-10-13 00:11:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2021-10-13 00:11:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-13 00:11:48,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:48,403 INFO L512 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-10-13 00:11:48,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:11:48,403 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:48,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1743207104, now seen corresponding path program 1 times [2021-10-13 00:11:48,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:48,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171882747] [2021-10-13 00:11:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:48,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:11:48,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:48,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171882747] [2021-10-13 00:11:48,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171882747] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:48,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:48,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:48,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541034599] [2021-10-13 00:11:48,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:48,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:48,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:48,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:48,477 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-10-13 00:11:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:50,084 INFO L93 Difference]: Finished difference Result 495 states and 765 transitions. [2021-10-13 00:11:50,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:50,085 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-10-13 00:11:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:50,086 INFO L225 Difference]: With dead ends: 495 [2021-10-13 00:11:50,087 INFO L226 Difference]: Without dead ends: 284 [2021-10-13 00:11:50,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-13 00:11:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2021-10-13 00:11:50,093 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-10-13 00:11:50,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2021-10-13 00:11:50,095 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 99 [2021-10-13 00:11:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:50,095 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2021-10-13 00:11:50,095 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-10-13 00:11:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2021-10-13 00:11:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-13 00:11:50,096 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:50,097 INFO L512 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-10-13 00:11:50,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 00:11:50,097 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:50,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1702532354, now seen corresponding path program 1 times [2021-10-13 00:11:50,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:50,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609849071] [2021-10-13 00:11:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:50,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:11:50,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:50,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609849071] [2021-10-13 00:11:50,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609849071] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:50,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:50,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:50,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864244212] [2021-10-13 00:11:50,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:50,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:50,197 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-10-13 00:11:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:52,498 INFO L93 Difference]: Finished difference Result 468 states and 727 transitions. [2021-10-13 00:11:52,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:52,500 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-10-13 00:11:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:52,502 INFO L225 Difference]: With dead ends: 468 [2021-10-13 00:11:52,502 INFO L226 Difference]: Without dead ends: 257 [2021-10-13 00:11:52,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-10-13 00:11:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2021-10-13 00:11:52,509 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-10-13 00:11:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2021-10-13 00:11:52,510 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 99 [2021-10-13 00:11:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:52,510 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2021-10-13 00:11:52,510 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-10-13 00:11:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2021-10-13 00:11:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 00:11:52,511 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:52,511 INFO L512 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-10-13 00:11:52,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 00:11:52,512 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1387645227, now seen corresponding path program 1 times [2021-10-13 00:11:52,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:52,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017326438] [2021-10-13 00:11:52,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:52,513 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:11:52,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:52,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017326438] [2021-10-13 00:11:52,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017326438] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:52,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:52,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:52,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898552198] [2021-10-13 00:11:52,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:52,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:52,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:52,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:52,583 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-10-13 00:11:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:54,926 INFO L93 Difference]: Finished difference Result 494 states and 760 transitions. [2021-10-13 00:11:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:11:54,926 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-10-13 00:11:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:54,928 INFO L225 Difference]: With dead ends: 494 [2021-10-13 00:11:54,928 INFO L226 Difference]: Without dead ends: 283 [2021-10-13 00:11:54,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-10-13 00:11:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2021-10-13 00:11:54,935 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-10-13 00:11:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2021-10-13 00:11:54,936 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 100 [2021-10-13 00:11:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:54,936 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2021-10-13 00:11:54,936 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-10-13 00:11:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2021-10-13 00:11:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 00:11:54,937 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:54,938 INFO L512 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-10-13 00:11:54,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 00:11:54,938 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2069311297, now seen corresponding path program 1 times [2021-10-13 00:11:54,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:54,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301389194] [2021-10-13 00:11:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:54,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-13 00:11:55,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:55,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301389194] [2021-10-13 00:11:55,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301389194] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:55,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:55,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:11:55,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514501727] [2021-10-13 00:11:55,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:11:55,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:55,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:11:55,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:11:55,025 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-10-13 00:11:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:11:59,398 INFO L93 Difference]: Finished difference Result 464 states and 721 transitions. [2021-10-13 00:11:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:11:59,399 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-10-13 00:11:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:11:59,400 INFO L225 Difference]: With dead ends: 464 [2021-10-13 00:11:59,400 INFO L226 Difference]: Without dead ends: 253 [2021-10-13 00:11:59,401 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:11:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-13 00:11:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-10-13 00:11:59,407 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-10-13 00:11:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 384 transitions. [2021-10-13 00:11:59,409 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 384 transitions. Word has length 100 [2021-10-13 00:11:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:11:59,409 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 384 transitions. [2021-10-13 00:11:59,409 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-10-13 00:11:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 384 transitions. [2021-10-13 00:11:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 00:11:59,410 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:11:59,411 INFO L512 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-10-13 00:11:59,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 00:11:59,411 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:11:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:11:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash -614780458, now seen corresponding path program 1 times [2021-10-13 00:11:59,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:11:59,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831976924] [2021-10-13 00:11:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:11:59,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:11:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:11:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:11:59,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:11:59,518 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831976924] [2021-10-13 00:11:59,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831976924] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:11:59,518 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:11:59,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:11:59,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970303592] [2021-10-13 00:11:59,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:11:59,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:11:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:11:59,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:11:59,520 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-10-13 00:12:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:01,865 INFO L93 Difference]: Finished difference Result 533 states and 808 transitions. [2021-10-13 00:12:01,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:01,866 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-10-13 00:12:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:01,867 INFO L225 Difference]: With dead ends: 533 [2021-10-13 00:12:01,867 INFO L226 Difference]: Without dead ends: 302 [2021-10-13 00:12:01,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-10-13 00:12:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2021-10-13 00:12:01,875 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-10-13 00:12:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 383 transitions. [2021-10-13 00:12:01,876 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 383 transitions. Word has length 100 [2021-10-13 00:12:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:01,877 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 383 transitions. [2021-10-13 00:12:01,877 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-10-13 00:12:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 383 transitions. [2021-10-13 00:12:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 00:12:01,878 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:01,878 INFO L512 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-10-13 00:12:01,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 00:12:01,879 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1564128618, now seen corresponding path program 1 times [2021-10-13 00:12:01,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:01,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318779425] [2021-10-13 00:12:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:01,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:01,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:01,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318779425] [2021-10-13 00:12:01,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318779425] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:01,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:01,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:01,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621744156] [2021-10-13 00:12:01,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:01,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:01,947 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-10-13 00:12:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:04,347 INFO L93 Difference]: Finished difference Result 531 states and 804 transitions. [2021-10-13 00:12:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:04,348 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-10-13 00:12:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:04,350 INFO L225 Difference]: With dead ends: 531 [2021-10-13 00:12:04,350 INFO L226 Difference]: Without dead ends: 300 [2021-10-13 00:12:04,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-10-13 00:12:04,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 252. [2021-10-13 00:12:04,358 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-10-13 00:12:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2021-10-13 00:12:04,360 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 100 [2021-10-13 00:12:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:04,360 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2021-10-13 00:12:04,360 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-10-13 00:12:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2021-10-13 00:12:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 00:12:04,361 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:04,362 INFO L512 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-10-13 00:12:04,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 00:12:04,362 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash 646136792, now seen corresponding path program 1 times [2021-10-13 00:12:04,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:04,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822455988] [2021-10-13 00:12:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:04,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:04,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:04,425 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822455988] [2021-10-13 00:12:04,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822455988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:04,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:04,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:04,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744530905] [2021-10-13 00:12:04,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:04,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:04,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:04,428 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-10-13 00:12:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:06,705 INFO L93 Difference]: Finished difference Result 506 states and 768 transitions. [2021-10-13 00:12:06,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:06,705 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-10-13 00:12:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:06,707 INFO L225 Difference]: With dead ends: 506 [2021-10-13 00:12:06,707 INFO L226 Difference]: Without dead ends: 275 [2021-10-13 00:12:06,708 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-10-13 00:12:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2021-10-13 00:12:06,715 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-10-13 00:12:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 381 transitions. [2021-10-13 00:12:06,716 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 381 transitions. Word has length 100 [2021-10-13 00:12:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:06,717 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 381 transitions. [2021-10-13 00:12:06,717 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-10-13 00:12:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 381 transitions. [2021-10-13 00:12:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 00:12:06,718 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:06,718 INFO L512 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-10-13 00:12:06,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 00:12:06,719 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash -303211368, now seen corresponding path program 1 times [2021-10-13 00:12:06,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:06,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150036914] [2021-10-13 00:12:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:06,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:06,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:06,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150036914] [2021-10-13 00:12:06,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150036914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:06,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:06,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:06,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754722084] [2021-10-13 00:12:06,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:06,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:06,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:06,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:06,803 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-10-13 00:12:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:09,043 INFO L93 Difference]: Finished difference Result 504 states and 764 transitions. [2021-10-13 00:12:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:09,043 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-10-13 00:12:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:09,044 INFO L225 Difference]: With dead ends: 504 [2021-10-13 00:12:09,045 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 00:12:09,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 00:12:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-10-13 00:12:09,052 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-10-13 00:12:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2021-10-13 00:12:09,053 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 100 [2021-10-13 00:12:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:09,054 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2021-10-13 00:12:09,054 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-10-13 00:12:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2021-10-13 00:12:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 00:12:09,055 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:09,055 INFO L512 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-10-13 00:12:09,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 00:12:09,056 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:09,056 INFO L82 PathProgramCache]: Analyzing trace with hash -222713380, now seen corresponding path program 1 times [2021-10-13 00:12:09,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:09,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729214907] [2021-10-13 00:12:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:09,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:09,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:09,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729214907] [2021-10-13 00:12:09,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729214907] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:09,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:09,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:09,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990871462] [2021-10-13 00:12:09,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:09,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:09,119 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-10-13 00:12:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:11,400 INFO L93 Difference]: Finished difference Result 531 states and 798 transitions. [2021-10-13 00:12:11,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:11,401 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-10-13 00:12:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:11,403 INFO L225 Difference]: With dead ends: 531 [2021-10-13 00:12:11,403 INFO L226 Difference]: Without dead ends: 300 [2021-10-13 00:12:11,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-10-13 00:12:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 252. [2021-10-13 00:12:11,411 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-10-13 00:12:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2021-10-13 00:12:11,412 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 101 [2021-10-13 00:12:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:11,413 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2021-10-13 00:12:11,413 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-10-13 00:12:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2021-10-13 00:12:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 00:12:11,414 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:11,414 INFO L512 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-10-13 00:12:11,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 00:12:11,415 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:11,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 211015706, now seen corresponding path program 1 times [2021-10-13 00:12:11,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:11,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583516383] [2021-10-13 00:12:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:11,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:11,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:11,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583516383] [2021-10-13 00:12:11,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583516383] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:11,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:11,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:11,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518309712] [2021-10-13 00:12:11,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:11,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:11,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:11,480 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-10-13 00:12:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:13,754 INFO L93 Difference]: Finished difference Result 504 states and 760 transitions. [2021-10-13 00:12:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:13,754 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-10-13 00:12:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:13,755 INFO L225 Difference]: With dead ends: 504 [2021-10-13 00:12:13,755 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 00:12:13,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 00:12:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-10-13 00:12:13,764 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-10-13 00:12:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2021-10-13 00:12:13,765 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 101 [2021-10-13 00:12:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:13,765 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2021-10-13 00:12:13,765 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-10-13 00:12:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2021-10-13 00:12:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-13 00:12:13,767 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:13,767 INFO L512 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-10-13 00:12:13,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 00:12:13,767 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash -84114702, now seen corresponding path program 1 times [2021-10-13 00:12:13,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:13,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968909027] [2021-10-13 00:12:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:13,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:13,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:13,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968909027] [2021-10-13 00:12:13,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968909027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:13,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:13,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:13,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037954103] [2021-10-13 00:12:13,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:13,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:13,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:13,845 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-10-13 00:12:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:16,267 INFO L93 Difference]: Finished difference Result 531 states and 794 transitions. [2021-10-13 00:12:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:16,268 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-10-13 00:12:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:16,270 INFO L225 Difference]: With dead ends: 531 [2021-10-13 00:12:16,270 INFO L226 Difference]: Without dead ends: 300 [2021-10-13 00:12:16,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-10-13 00:12:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 252. [2021-10-13 00:12:16,278 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-10-13 00:12:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2021-10-13 00:12:16,279 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 102 [2021-10-13 00:12:16,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:16,280 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2021-10-13 00:12:16,280 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-10-13 00:12:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2021-10-13 00:12:16,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-13 00:12:16,281 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:16,281 INFO L512 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-10-13 00:12:16,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 00:12:16,282 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:16,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:16,282 INFO L82 PathProgramCache]: Analyzing trace with hash 476585076, now seen corresponding path program 1 times [2021-10-13 00:12:16,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:16,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912146826] [2021-10-13 00:12:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:16,283 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:16,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:16,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912146826] [2021-10-13 00:12:16,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912146826] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:16,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:16,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:16,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269678850] [2021-10-13 00:12:16,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:16,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:16,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:16,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:16,343 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-10-13 00:12:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:18,617 INFO L93 Difference]: Finished difference Result 504 states and 756 transitions. [2021-10-13 00:12:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:18,618 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-10-13 00:12:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:18,619 INFO L225 Difference]: With dead ends: 504 [2021-10-13 00:12:18,619 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 00:12:18,620 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 00:12:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-10-13 00:12:18,628 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-10-13 00:12:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2021-10-13 00:12:18,629 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 102 [2021-10-13 00:12:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:18,630 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2021-10-13 00:12:18,630 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-10-13 00:12:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2021-10-13 00:12:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-13 00:12:18,631 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:18,631 INFO L512 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-10-13 00:12:18,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 00:12:18,632 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1285223625, now seen corresponding path program 1 times [2021-10-13 00:12:18,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:18,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801893001] [2021-10-13 00:12:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:18,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:18,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:18,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801893001] [2021-10-13 00:12:18,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801893001] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:18,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:18,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:18,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018884341] [2021-10-13 00:12:18,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:18,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:18,695 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-10-13 00:12:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:21,104 INFO L93 Difference]: Finished difference Result 531 states and 790 transitions. [2021-10-13 00:12:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:21,105 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-10-13 00:12:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:21,107 INFO L225 Difference]: With dead ends: 531 [2021-10-13 00:12:21,107 INFO L226 Difference]: Without dead ends: 300 [2021-10-13 00:12:21,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-10-13 00:12:21,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 252. [2021-10-13 00:12:21,116 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-10-13 00:12:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2021-10-13 00:12:21,117 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 103 [2021-10-13 00:12:21,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:21,117 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2021-10-13 00:12:21,117 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-10-13 00:12:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2021-10-13 00:12:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-13 00:12:21,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:21,135 INFO L512 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-10-13 00:12:21,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 00:12:21,136 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:21,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1083399691, now seen corresponding path program 1 times [2021-10-13 00:12:21,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:21,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484032142] [2021-10-13 00:12:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:21,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:21,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:21,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484032142] [2021-10-13 00:12:21,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484032142] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:21,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:21,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:21,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872294316] [2021-10-13 00:12:21,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:21,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:21,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:21,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:21,200 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-10-13 00:12:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:23,461 INFO L93 Difference]: Finished difference Result 504 states and 752 transitions. [2021-10-13 00:12:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:23,462 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-10-13 00:12:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:23,463 INFO L225 Difference]: With dead ends: 504 [2021-10-13 00:12:23,463 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 00:12:23,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 00:12:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-10-13 00:12:23,472 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-10-13 00:12:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2021-10-13 00:12:23,473 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 103 [2021-10-13 00:12:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:23,473 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2021-10-13 00:12:23,473 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-10-13 00:12:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2021-10-13 00:12:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-13 00:12:23,474 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:23,475 INFO L512 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-10-13 00:12:23,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 00:12:23,475 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:23,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1067595219, now seen corresponding path program 1 times [2021-10-13 00:12:23,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:23,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630192090] [2021-10-13 00:12:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:23,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:23,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:23,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630192090] [2021-10-13 00:12:23,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630192090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:23,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:23,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:23,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703723602] [2021-10-13 00:12:23,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:23,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:23,538 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-10-13 00:12:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:25,336 INFO L93 Difference]: Finished difference Result 521 states and 774 transitions. [2021-10-13 00:12:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:25,336 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-10-13 00:12:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:25,338 INFO L225 Difference]: With dead ends: 521 [2021-10-13 00:12:25,338 INFO L226 Difference]: Without dead ends: 290 [2021-10-13 00:12:25,339 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-13 00:12:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 252. [2021-10-13 00:12:25,346 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-10-13 00:12:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2021-10-13 00:12:25,347 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 104 [2021-10-13 00:12:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:25,348 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2021-10-13 00:12:25,348 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-10-13 00:12:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2021-10-13 00:12:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-13 00:12:25,349 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:25,349 INFO L512 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-10-13 00:12:25,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 00:12:25,350 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 893979439, now seen corresponding path program 1 times [2021-10-13 00:12:25,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:25,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5072822] [2021-10-13 00:12:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:25,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:25,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:25,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5072822] [2021-10-13 00:12:25,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5072822] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:25,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:25,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:25,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139003659] [2021-10-13 00:12:25,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:25,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:25,412 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-10-13 00:12:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:27,636 INFO L93 Difference]: Finished difference Result 494 states and 736 transitions. [2021-10-13 00:12:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:27,636 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-10-13 00:12:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:27,637 INFO L225 Difference]: With dead ends: 494 [2021-10-13 00:12:27,637 INFO L226 Difference]: Without dead ends: 263 [2021-10-13 00:12:27,638 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-13 00:12:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2021-10-13 00:12:27,645 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-10-13 00:12:27,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2021-10-13 00:12:27,646 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 104 [2021-10-13 00:12:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:27,646 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2021-10-13 00:12:27,646 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-10-13 00:12:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2021-10-13 00:12:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 00:12:27,648 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:27,648 INFO L512 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-10-13 00:12:27,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 00:12:27,678 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 321692089, now seen corresponding path program 1 times [2021-10-13 00:12:27,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:27,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277762744] [2021-10-13 00:12:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:27,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 00:12:27,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:27,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277762744] [2021-10-13 00:12:27,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277762744] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:27,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:27,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:12:27,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884333392] [2021-10-13 00:12:27,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:27,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:27,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:27,757 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-10-13 00:12:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:29,961 INFO L93 Difference]: Finished difference Result 521 states and 770 transitions. [2021-10-13 00:12:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:29,962 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-10-13 00:12:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:29,963 INFO L225 Difference]: With dead ends: 521 [2021-10-13 00:12:29,963 INFO L226 Difference]: Without dead ends: 290 [2021-10-13 00:12:29,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:29,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-13 00:12:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 252. [2021-10-13 00:12:29,971 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-10-13 00:12:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2021-10-13 00:12:29,972 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 108 [2021-10-13 00:12:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:29,973 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2021-10-13 00:12:29,973 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-10-13 00:12:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2021-10-13 00:12:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 00:12:29,974 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:29,974 INFO L512 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-10-13 00:12:29,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 00:12:29,975 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:29,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:29,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1364487749, now seen corresponding path program 1 times [2021-10-13 00:12:29,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:29,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563121858] [2021-10-13 00:12:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:29,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-13 00:12:30,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:30,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563121858] [2021-10-13 00:12:30,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563121858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:30,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:30,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:12:30,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396343893] [2021-10-13 00:12:30,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:12:30,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:30,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:12:30,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:12:30,035 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-10-13 00:12:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:30,060 INFO L93 Difference]: Finished difference Result 709 states and 1058 transitions. [2021-10-13 00:12:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:12:30,061 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-10-13 00:12:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:30,063 INFO L225 Difference]: With dead ends: 709 [2021-10-13 00:12:30,063 INFO L226 Difference]: Without dead ends: 478 [2021-10-13 00:12:30,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:12:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-10-13 00:12:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2021-10-13 00:12:30,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.4842767295597483) internal successors, (708), 477 states have internal predecessors, (708), 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-10-13 00:12:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 708 transitions. [2021-10-13 00:12:30,084 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 708 transitions. Word has length 108 [2021-10-13 00:12:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:30,084 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 708 transitions. [2021-10-13 00:12:30,084 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-10-13 00:12:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 708 transitions. [2021-10-13 00:12:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 00:12:30,086 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:30,086 INFO L512 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-10-13 00:12:30,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 00:12:30,087 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:30,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:30,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1714325821, now seen corresponding path program 1 times [2021-10-13 00:12:30,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:30,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744103003] [2021-10-13 00:12:30,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:30,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-13 00:12:30,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:30,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744103003] [2021-10-13 00:12:30,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744103003] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:30,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:30,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:12:30,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157949541] [2021-10-13 00:12:30,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:12:30,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:12:30,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:12:30,142 INFO L87 Difference]: Start difference. First operand 478 states and 708 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-10-13 00:12:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:30,170 INFO L93 Difference]: Finished difference Result 962 states and 1428 transitions. [2021-10-13 00:12:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:12:30,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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 108 [2021-10-13 00:12:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:30,173 INFO L225 Difference]: With dead ends: 962 [2021-10-13 00:12:30,173 INFO L226 Difference]: Without dead ends: 505 [2021-10-13 00:12:30,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:12:30,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-13 00:12:30,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2021-10-13 00:12:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 1.4742063492063493) internal successors, (743), 504 states have internal predecessors, (743), 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-10-13 00:12:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 743 transitions. [2021-10-13 00:12:30,190 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 743 transitions. Word has length 108 [2021-10-13 00:12:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:30,191 INFO L470 AbstractCegarLoop]: Abstraction has 505 states and 743 transitions. [2021-10-13 00:12:30,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 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-10-13 00:12:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 743 transitions. [2021-10-13 00:12:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 00:12:30,192 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:30,193 INFO L512 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-10-13 00:12:30,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-13 00:12:30,193 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:30,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1128049599, now seen corresponding path program 1 times [2021-10-13 00:12:30,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:30,194 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458654501] [2021-10-13 00:12:30,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:30,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-10-13 00:12:30,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:30,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458654501] [2021-10-13 00:12:30,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458654501] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:30,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:30,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:12:30,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422380751] [2021-10-13 00:12:30,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:12:30,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:30,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:12:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:12:30,257 INFO L87 Difference]: Start difference. First operand 505 states and 743 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-13 00:12:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:30,278 INFO L93 Difference]: Finished difference Result 991 states and 1464 transitions. [2021-10-13 00:12:30,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:12:30,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-13 00:12:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:30,281 INFO L225 Difference]: With dead ends: 991 [2021-10-13 00:12:30,281 INFO L226 Difference]: Without dead ends: 507 [2021-10-13 00:12:30,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:12:30,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-10-13 00:12:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2021-10-13 00:12:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.4723320158102766) internal successors, (745), 506 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-10-13 00:12:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 745 transitions. [2021-10-13 00:12:30,299 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 745 transitions. Word has length 108 [2021-10-13 00:12:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:30,299 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 745 transitions. [2021-10-13 00:12:30,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-10-13 00:12:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 745 transitions. [2021-10-13 00:12:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-13 00:12:30,301 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:30,301 INFO L512 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-10-13 00:12:30,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-13 00:12:30,301 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:30,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:30,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1128276771, now seen corresponding path program 1 times [2021-10-13 00:12:30,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:30,302 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081398106] [2021-10-13 00:12:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:30,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-10-13 00:12:30,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:12:30,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081398106] [2021-10-13 00:12:30,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081398106] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:30,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:30,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:12:30,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281347518] [2021-10-13 00:12:30,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:12:30,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:12:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:12:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:12:30,586 INFO L87 Difference]: Start difference. First operand 507 states and 745 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-10-13 00:12:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:34,458 INFO L93 Difference]: Finished difference Result 1011 states and 1486 transitions. [2021-10-13 00:12:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:12:34,459 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-10-13 00:12:34,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:34,461 INFO L225 Difference]: With dead ends: 1011 [2021-10-13 00:12:34,461 INFO L226 Difference]: Without dead ends: 507 [2021-10-13 00:12:34,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:12:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-10-13 00:12:34,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2021-10-13 00:12:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 1.4703557312252964) internal successors, (744), 506 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-10-13 00:12:34,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 744 transitions. [2021-10-13 00:12:34,478 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 744 transitions. Word has length 127 [2021-10-13 00:12:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:34,478 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 744 transitions. [2021-10-13 00:12:34,479 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-10-13 00:12:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 744 transitions. [2021-10-13 00:12:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-13 00:12:34,480 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:34,480 INFO L512 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-10-13 00:12:34,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-13 00:12:34,482 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:34,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:34,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1834873377, now seen corresponding path program 1 times [2021-10-13 00:12:34,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:12:34,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479428125] [2021-10-13 00:12:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:34,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:12:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:12:34,794 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:12:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:12:35,158 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:12:35,158 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:12:35,159 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:12:35,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-13 00:12:35,166 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:12:35,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:12:35 BoogieIcfgContainer [2021-10-13 00:12:35,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:12:35,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:12:35,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:12:35,278 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:12:35,279 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:11:00" (3/4) ... [2021-10-13 00:12:35,282 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 00:12:35,283 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:12:35,285 INFO L168 Benchmark]: Toolchain (without parser) took 99557.25 ms. Allocated memory was 104.9 MB in the beginning and 190.8 MB in the end (delta: 86.0 MB). Free memory was 63.3 MB in the beginning and 113.2 MB in the end (delta: -49.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:12:35,286 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 104.9 MB. Free memory was 81.9 MB in the beginning and 81.8 MB in the end (delta: 55.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:12:35,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.72 ms. Allocated memory is still 104.9 MB. Free memory was 63.1 MB in the beginning and 57.5 MB in the end (delta: 5.5 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:12:35,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.65 ms. Allocated memory is still 104.9 MB. Free memory was 57.5 MB in the beginning and 52.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:12:35,287 INFO L168 Benchmark]: Boogie Preprocessor took 112.34 ms. Allocated memory is still 104.9 MB. Free memory was 52.8 MB in the beginning and 45.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:12:35,288 INFO L168 Benchmark]: RCFGBuilder took 3333.42 ms. Allocated memory was 104.9 MB in the beginning and 151.0 MB in the end (delta: 46.1 MB). Free memory was 45.0 MB in the beginning and 107.6 MB in the end (delta: -62.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:12:35,288 INFO L168 Benchmark]: TraceAbstraction took 95221.97 ms. Allocated memory was 151.0 MB in the beginning and 190.8 MB in the end (delta: 39.8 MB). Free memory was 106.6 MB in the beginning and 114.3 MB in the end (delta: -7.7 MB). Peak memory consumption was 99.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:12:35,289 INFO L168 Benchmark]: Witness Printer took 7.12 ms. Allocated memory is still 190.8 MB. Free memory was 114.3 MB in the beginning and 113.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:12:35,291 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.24 ms. Allocated memory is still 104.9 MB. Free memory was 81.9 MB in the beginning and 81.8 MB in the end (delta: 55.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 734.72 ms. Allocated memory is still 104.9 MB. Free memory was 63.1 MB in the beginning and 57.5 MB in the end (delta: 5.5 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 139.65 ms. Allocated memory is still 104.9 MB. Free memory was 57.5 MB in the beginning and 52.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 112.34 ms. Allocated memory is still 104.9 MB. Free memory was 52.8 MB in the beginning and 45.0 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3333.42 ms. Allocated memory was 104.9 MB in the beginning and 151.0 MB in the end (delta: 46.1 MB). Free memory was 45.0 MB in the beginning and 107.6 MB in the end (delta: -62.7 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 95221.97 ms. Allocated memory was 151.0 MB in the beginning and 190.8 MB in the end (delta: 39.8 MB). Free memory was 106.6 MB in the beginning and 114.3 MB in the end (delta: -7.7 MB). Peak memory consumption was 99.2 MB. Max. memory is 16.1 GB. * Witness Printer took 7.12 ms. Allocated memory is still 190.8 MB. Free memory was 114.3 MB in the beginning and 113.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1723]: 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 1142. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={21:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1078] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1079] s->options = __VERIFIER_nondet_ulong() [L1080] s->verify_mode = __VERIFIER_nondet_int() [L1081] EXPR s->session [L1081] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1082] EXPR s->s3 [L1082] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1083] EXPR s->s3 [L1083] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1084] EXPR s->s3 [L1084] EXPR (s->s3)->tmp.new_cipher [L1084] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1085] EXPR s->s3 [L1085] EXPR (s->s3)->tmp.new_cipher [L1085] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1086] COND FALSE !(__VERIFIER_nondet_int()) [L1092] s->cert = malloc(sizeof(struct cert_st)) [L1093] EXPR s->cert [L1093] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1102] BUF_MEM *buf ; [L1103] unsigned long l ; [L1104] unsigned long Time ; [L1105] unsigned long tmp ; [L1106] void (*cb)() ; [L1107] long num1 ; [L1108] int ret ; [L1109] int new_state ; [L1110] int state ; [L1111] int skip ; [L1112] int got_new_session ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 ; [L1120] long tmp___8 = __VERIFIER_nondet_long() ; [L1121] int tmp___9 = __VERIFIER_nondet_int() ; [L1122] int tmp___10 = __VERIFIER_nondet_int() ; [L1123] int blastFlag ; [L1127] blastFlag = 0 [L1128] s->hit=__VERIFIER_nondet_int () [L1129] s->state = 8464 [L1130] tmp = __VERIFIER_nondet_int() [L1131] Time = tmp [L1132] cb = (void (*)())((void *)0) [L1133] ret = -1 [L1134] skip = 0 [L1135] got_new_session = 0 [L1136] EXPR s->info_callback VAL [init=1, SSLv3_server_data={21:0}] [L1136] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1137] EXPR s->info_callback [L1137] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={21:0}] [L1151] EXPR s->cert VAL [init=1, SSLv3_server_data={21:0}] [L1151] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={21:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1184] COND TRUE s->state == 8464 [L1344] s->shutdown = 0 [L1345] ret = __VERIFIER_nondet_int() [L1346] COND TRUE blastFlag == 0 [L1347] blastFlag = 1 VAL [init=1, SSLv3_server_data={21:0}] [L1351] COND FALSE !(ret <= 0) [L1356] got_new_session = 1 [L1357] s->state = 8496 [L1358] s->init_num = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={21:0}] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={21:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1193] COND TRUE s->state == 8496 [L1362] ret = __VERIFIER_nondet_int() [L1363] COND TRUE blastFlag == 1 [L1364] blastFlag = 2 VAL [init=1, SSLv3_server_data={21:0}] [L1368] COND FALSE !(ret <= 0) [L1373] s->hit VAL [init=1, SSLv3_server_data={21:0}] [L1373] COND TRUE s->hit [L1374] s->state = 8656 VAL [init=1, SSLv3_server_data={21:0}] [L1378] s->init_num = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={21:0}] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={21:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1193] COND FALSE !(s->state == 8496) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1196] COND FALSE !(s->state == 8497) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1199] COND FALSE !(s->state == 8512) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1202] COND FALSE !(s->state == 8513) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1205] COND FALSE !(s->state == 8528) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1208] COND FALSE !(s->state == 8529) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1211] COND FALSE !(s->state == 8544) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1214] COND FALSE !(s->state == 8545) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1217] COND FALSE !(s->state == 8560) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1220] COND FALSE !(s->state == 8561) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1223] COND FALSE !(s->state == 8448) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1226] COND FALSE !(s->state == 8576) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1229] COND FALSE !(s->state == 8577) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1232] COND FALSE !(s->state == 8592) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1235] COND FALSE !(s->state == 8593) [L1238] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1238] COND FALSE !(s->state == 8608) [L1241] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1241] COND FALSE !(s->state == 8609) [L1244] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1244] COND FALSE !(s->state == 8640) [L1247] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1247] COND FALSE !(s->state == 8641) [L1250] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1250] COND TRUE s->state == 8656 [L1571] EXPR s->session [L1571] EXPR s->s3 [L1571] EXPR (s->s3)->tmp.new_cipher [L1571] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1572] COND FALSE !(! tmp___9) [L1578] ret = __VERIFIER_nondet_int() [L1579] COND TRUE blastFlag == 2 [L1580] blastFlag = 4 VAL [init=1, SSLv3_server_data={21:0}] [L1588] COND FALSE !(ret <= 0) [L1593] s->state = 8672 [L1594] s->init_num = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1595] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={21:0}] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={21:0}] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={21:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1193] COND FALSE !(s->state == 8496) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1196] COND FALSE !(s->state == 8497) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1199] COND FALSE !(s->state == 8512) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1202] COND FALSE !(s->state == 8513) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1205] COND FALSE !(s->state == 8528) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1208] COND FALSE !(s->state == 8529) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1211] COND FALSE !(s->state == 8544) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1214] COND FALSE !(s->state == 8545) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1217] COND FALSE !(s->state == 8560) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1220] COND FALSE !(s->state == 8561) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1223] COND FALSE !(s->state == 8448) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1226] COND FALSE !(s->state == 8576) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1229] COND FALSE !(s->state == 8577) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1232] COND FALSE !(s->state == 8592) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1235] COND FALSE !(s->state == 8593) [L1238] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1238] COND FALSE !(s->state == 8608) [L1241] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1241] COND FALSE !(s->state == 8609) [L1244] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1244] COND FALSE !(s->state == 8640) [L1247] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1247] COND FALSE !(s->state == 8641) [L1250] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1250] COND FALSE !(s->state == 8656) [L1253] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1253] COND FALSE !(s->state == 8657) [L1256] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1256] COND TRUE s->state == 8672 [L1604] ret = __VERIFIER_nondet_int() [L1605] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={21:0}] [L1723] reach_error() VAL [init=1, SSLv3_server_data={21:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 95056.2ms, OverallIterations: 42, TraceHistogramMax: 4, EmptinessCheckTime: 96.6ms, AutomataDifference: 89952.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7824 SDtfs, 2096 SDslu, 11522 SDs, 0 SdLazy, 7148 SolverSat, 346 SolverUnsat, 34 SolverUnknown, 0 SolverNotchecked, 86413.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 83 SyntacticMatches, 29 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 571.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=507occurred 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.0ms DumpTime, AutomataMinimizationStatistics: 372.8ms AutomataMinimizationTime, 41 MinimizatonAttempts, 924 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 295.4ms SsaConstructionTime, 1404.3ms SatisfiabilityAnalysisTime, 2026.7ms InterpolantComputationTime, 3709 NumberOfCodeBlocks, 3709 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3541 ConstructedInterpolants, 0 QuantifiedInterpolants, 9600 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-10-13 00:12:35,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:12:37,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:12:37,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:12:37,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:12:37,611 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:12:37,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:12:37,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:12:37,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:12:37,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:12:37,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:12:37,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:12:37,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:12:37,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:12:37,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:12:37,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:12:37,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:12:37,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:12:37,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:12:37,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:12:37,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:12:37,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:12:37,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:12:37,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:12:37,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:12:37,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:12:37,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:12:37,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:12:37,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:12:37,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:12:37,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:12:37,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:12:37,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:12:37,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:12:37,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:12:37,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:12:37,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:12:37,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:12:37,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:12:37,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:12:37,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:12:37,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:12:37,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-10-13 00:12:37,719 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:12:37,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:12:37,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:12:37,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:12:37,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:12:37,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:12:37,725 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:12:37,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:12:37,725 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:12:37,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:12:37,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:12:37,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:12:37,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:12:37,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:12:37,728 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 00:12:37,728 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 00:12:37,728 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:12:37,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:12:37,728 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:12:37,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:12:37,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:12:37,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:12:37,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:12:37,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:12:37,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:12:37,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:12:37,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:12:37,730 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-13 00:12:37,731 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 00:12:37,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:12:37,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:12:37,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 00:12:37,732 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_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/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_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt 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 -> 9aa9ee37cd3362e609678719aa2feba1ed8c3980 [2021-10-13 00:12:38,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:12:38,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:12:38,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:12:38,142 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:12:38,143 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:12:38,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2021-10-13 00:12:38,218 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data/3314ec067/ce54e45d914d46d5892a15b01811a4a1/FLAG647b33d5b [2021-10-13 00:12:38,914 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:12:38,914 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c [2021-10-13 00:12:38,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data/3314ec067/ce54e45d914d46d5892a15b01811a4a1/FLAG647b33d5b [2021-10-13 00:12:39,135 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/data/3314ec067/ce54e45d914d46d5892a15b01811a4a1 [2021-10-13 00:12:39,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:12:39,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:12:39,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:12:39,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:12:39,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:12:39,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:39,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@251d65dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39, skipping insertion in model container [2021-10-13 00:12:39,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:39,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:12:39,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:12:39,644 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_420acd97-1e10-4bec-be35-8ff24108a658/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[72022,72035] [2021-10-13 00:12:39,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:12:39,675 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:12:39,837 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_420acd97-1e10-4bec-be35-8ff24108a658/sv-benchmarks/c/openssl/s3_srvr.blast.04.i.cil.c[72022,72035] [2021-10-13 00:12:39,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:12:39,858 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:12:39,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39 WrapperNode [2021-10-13 00:12:39,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:12:39,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:12:39,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:12:39,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:12:39,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:39,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:39,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:12:39,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:12:39,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:12:39,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:12:39,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:39,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:40,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:40,037 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:40,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:40,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:40,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:40,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:12:40,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:12:40,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:12:40,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:12:40,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (1/1) ... [2021-10-13 00:12:40,146 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:12:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:12:40,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:12:40,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:12:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 00:12:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 00:12:40,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:12:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-13 00:12:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 00:12:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 00:12:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:12:40,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:12:40,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-13 00:12:40,495 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 00:12:44,503 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-13 00:12:44,503 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-13 00:12:44,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:12:44,521 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 00:12:44,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:12:44 BoogieIcfgContainer [2021-10-13 00:12:44,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:12:44,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:12:44,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:12:44,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:12:44,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:12:39" (1/3) ... [2021-10-13 00:12:44,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c85c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:12:44, skipping insertion in model container [2021-10-13 00:12:44,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:12:39" (2/3) ... [2021-10-13 00:12:44,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c85c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:12:44, skipping insertion in model container [2021-10-13 00:12:44,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:12:44" (3/3) ... [2021-10-13 00:12:44,533 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2021-10-13 00:12:44,538 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:12:44,539 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 00:12:44,602 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:12:44,611 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, mConcurrency=FINITE_AUTOMATA, 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-10-13 00:12:44,611 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 00:12:44,636 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-10-13 00:12:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 00:12:44,657 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:44,658 INFO L512 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-10-13 00:12:44,658 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:44,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1430118927, now seen corresponding path program 1 times [2021-10-13 00:12:44,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 00:12:44,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756705737] [2021-10-13 00:12:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:44,680 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 00:12:44,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat [2021-10-13 00:12:44,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 00:12:44,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 00:12:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:44,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:12:44,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:12:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:12:45,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 00:12:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:12:45,659 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 00:12:45,660 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756705737] [2021-10-13 00:12:45,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756705737] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:45,660 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:45,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 00:12:45,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088627264] [2021-10-13 00:12:45,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:45,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 00:12:45,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:45,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:45,682 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-10-13 00:12:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:45,846 INFO L93 Difference]: Finished difference Result 542 states and 920 transitions. [2021-10-13 00:12:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:45,847 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-10-13 00:12:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:45,861 INFO L225 Difference]: With dead ends: 542 [2021-10-13 00:12:45,861 INFO L226 Difference]: Without dead ends: 368 [2021-10-13 00:12:45,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-10-13 00:12:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2021-10-13 00:12:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.5231607629427792) internal successors, (559), 367 states have internal predecessors, (559), 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-10-13 00:12:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 559 transitions. [2021-10-13 00:12:45,929 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 559 transitions. Word has length 47 [2021-10-13 00:12:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:45,929 INFO L470 AbstractCegarLoop]: Abstraction has 368 states and 559 transitions. [2021-10-13 00:12:45,930 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-10-13 00:12:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 559 transitions. [2021-10-13 00:12:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-13 00:12:45,937 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:45,937 INFO L512 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-10-13 00:12:45,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 00:12:46,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 [2021-10-13 00:12:46,152 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:46,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash -709781834, now seen corresponding path program 1 times [2021-10-13 00:12:46,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 00:12:46,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643082187] [2021-10-13 00:12:46,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:46,155 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 00:12:46,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat [2021-10-13 00:12:46,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 00:12:46,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 00:12:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:46,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 00:12:46,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:12:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:12:46,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 00:12:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:12:47,345 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 00:12:47,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643082187] [2021-10-13 00:12:47,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643082187] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:47,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:47,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 00:12:47,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406045118] [2021-10-13 00:12:47,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:12:47,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 00:12:47,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:12:47,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:47,349 INFO L87 Difference]: Start difference. First operand 368 states and 559 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-10-13 00:12:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:47,484 INFO L93 Difference]: Finished difference Result 841 states and 1285 transitions. [2021-10-13 00:12:47,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:12:47,485 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-10-13 00:12:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:47,489 INFO L225 Difference]: With dead ends: 841 [2021-10-13 00:12:47,489 INFO L226 Difference]: Without dead ends: 602 [2021-10-13 00:12:47,496 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:12:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-10-13 00:12:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2021-10-13 00:12:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.519134775374376) internal successors, (913), 601 states have internal predecessors, (913), 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-10-13 00:12:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 913 transitions. [2021-10-13 00:12:47,552 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 913 transitions. Word has length 105 [2021-10-13 00:12:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:47,553 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 913 transitions. [2021-10-13 00:12:47,553 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-10-13 00:12:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 913 transitions. [2021-10-13 00:12:47,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-13 00:12:47,561 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:47,562 INFO L512 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-10-13 00:12:47,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 00:12:47,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 [2021-10-13 00:12:47,776 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:47,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1128276771, now seen corresponding path program 1 times [2021-10-13 00:12:47,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 00:12:47,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871518948] [2021-10-13 00:12:47,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:47,778 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 00:12:47,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat [2021-10-13 00:12:47,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 00:12:47,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 00:12:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:12:48,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-13 00:12:48,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 00:12:48,270 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-10-13 00:12:48,284 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-10-13 00:12:48,439 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-10-13 00:12:48,440 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-10-13 00:12:48,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:12:48,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:12:48,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:12:48,472 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-10-13 00:12:48,577 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-10-13 00:12:48,577 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-10-13 00:12:48,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 00:12:48,599 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-10-13 00:12:48,644 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-10-13 00:12:48,651 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-10-13 00:12:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-10-13 00:12:49,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 00:12:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-10-13 00:12:49,825 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 00:12:49,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871518948] [2021-10-13 00:12:49,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871518948] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 00:12:49,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:12:49,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-10-13 00:12:49,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527414681] [2021-10-13 00:12:49,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:12:49,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 00:12:49,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:12:49,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:12:49,834 INFO L87 Difference]: Start difference. First operand 602 states and 913 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-10-13 00:12:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:12:57,787 INFO L93 Difference]: Finished difference Result 1201 states and 1822 transitions. [2021-10-13 00:12:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:12:57,789 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-10-13 00:12:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:12:57,793 INFO L225 Difference]: With dead ends: 1201 [2021-10-13 00:12:57,793 INFO L226 Difference]: Without dead ends: 602 [2021-10-13 00:12:57,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 287.5ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:12:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-10-13 00:12:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2021-10-13 00:12:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.5174708818635607) internal successors, (912), 601 states have internal predecessors, (912), 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-10-13 00:12:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 912 transitions. [2021-10-13 00:12:57,826 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 912 transitions. Word has length 127 [2021-10-13 00:12:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:12:57,826 INFO L470 AbstractCegarLoop]: Abstraction has 602 states and 912 transitions. [2021-10-13 00:12:57,827 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-10-13 00:12:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 912 transitions. [2021-10-13 00:12:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-13 00:12:57,829 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:12:57,829 INFO L512 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-10-13 00:12:57,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 00:12:58,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 [2021-10-13 00:12:58,047 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 00:12:58,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:12:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1834873377, now seen corresponding path program 1 times [2021-10-13 00:12:58,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 00:12:58,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540589375] [2021-10-13 00:12:58,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:12:58,050 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 00:12:58,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat [2021-10-13 00:12:58,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 00:12:58,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 00:12:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:12:59,066 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:12:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:12:59,984 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-10-13 00:12:59,985 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:12:59,985 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:13:00,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 00:13:00,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 [2021-10-13 00:13:00,199 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:13:00,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:13:00 BoogieIcfgContainer [2021-10-13 00:13:00,363 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:13:00,364 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:13:00,364 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:13:00,364 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:13:00,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:12:44" (3/4) ... [2021-10-13 00:13:00,366 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:13:00,504 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:13:00,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:13:00,505 INFO L168 Benchmark]: Toolchain (without parser) took 21354.65 ms. Allocated memory was 83.9 MB in the beginning and 136.3 MB in the end (delta: 52.4 MB). Free memory was 59.9 MB in the beginning and 75.0 MB in the end (delta: -15.1 MB). Peak memory consumption was 36.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:00,506 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 50.3 MB. Free memory is still 30.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:13:00,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.12 ms. Allocated memory is still 83.9 MB. Free memory was 59.7 MB in the beginning and 46.0 MB in the end (delta: 13.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:00,506 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.43 ms. Allocated memory is still 83.9 MB. Free memory was 46.0 MB in the beginning and 41.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:00,507 INFO L168 Benchmark]: Boogie Preprocessor took 147.35 ms. Allocated memory is still 83.9 MB. Free memory was 41.1 MB in the beginning and 58.0 MB in the end (delta: -16.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:00,507 INFO L168 Benchmark]: RCFGBuilder took 4387.10 ms. Allocated memory was 83.9 MB in the beginning and 113.2 MB in the end (delta: 29.4 MB). Free memory was 57.6 MB in the beginning and 65.9 MB in the end (delta: -8.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:00,508 INFO L168 Benchmark]: TraceAbstraction took 15837.52 ms. Allocated memory was 113.2 MB in the beginning and 136.3 MB in the end (delta: 23.1 MB). Free memory was 65.2 MB in the beginning and 89.7 MB in the end (delta: -24.4 MB). Peak memory consumption was 42.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:00,508 INFO L168 Benchmark]: Witness Printer took 140.87 ms. Allocated memory is still 136.3 MB. Free memory was 89.7 MB in the beginning and 75.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:13:00,511 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.20 ms. Allocated memory is still 50.3 MB. Free memory is still 30.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 710.12 ms. Allocated memory is still 83.9 MB. Free memory was 59.7 MB in the beginning and 46.0 MB in the end (delta: 13.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 125.43 ms. Allocated memory is still 83.9 MB. Free memory was 46.0 MB in the beginning and 41.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 147.35 ms. Allocated memory is still 83.9 MB. Free memory was 41.1 MB in the beginning and 58.0 MB in the end (delta: -16.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4387.10 ms. Allocated memory was 83.9 MB in the beginning and 113.2 MB in the end (delta: 29.4 MB). Free memory was 57.6 MB in the beginning and 65.9 MB in the end (delta: -8.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15837.52 ms. Allocated memory was 113.2 MB in the beginning and 136.3 MB in the end (delta: 23.1 MB). Free memory was 65.2 MB in the beginning and 89.7 MB in the end (delta: -24.4 MB). Peak memory consumption was 42.6 MB. Max. memory is 16.1 GB. * Witness Printer took 140.87 ms. Allocated memory is still 136.3 MB. Free memory was 89.7 MB in the beginning and 75.0 MB in the end (delta: 14.7 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1723]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1078] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1079] s->options = __VERIFIER_nondet_ulong() [L1080] s->verify_mode = __VERIFIER_nondet_int() [L1081] EXPR s->session [L1081] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1082] EXPR s->s3 [L1082] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1083] EXPR s->s3 [L1083] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1084] EXPR s->s3 [L1084] EXPR (s->s3)->tmp.new_cipher [L1084] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1085] EXPR s->s3 [L1085] EXPR (s->s3)->tmp.new_cipher [L1085] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1086] COND FALSE !(__VERIFIER_nondet_int()) [L1092] s->cert = malloc(sizeof(struct cert_st)) [L1093] EXPR s->cert [L1093] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1102] BUF_MEM *buf ; [L1103] unsigned long l ; [L1104] unsigned long Time ; [L1105] unsigned long tmp ; [L1106] void (*cb)() ; [L1107] long num1 ; [L1108] int ret ; [L1109] int new_state ; [L1110] int state ; [L1111] int skip ; [L1112] int got_new_session ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 ; [L1120] long tmp___8 = __VERIFIER_nondet_long() ; [L1121] int tmp___9 = __VERIFIER_nondet_int() ; [L1122] int tmp___10 = __VERIFIER_nondet_int() ; [L1123] int blastFlag ; [L1127] blastFlag = 0 [L1128] s->hit=__VERIFIER_nondet_int () [L1129] s->state = 8464 [L1130] tmp = __VERIFIER_nondet_int() [L1131] Time = tmp [L1132] cb = (void (*)())((void *)0) [L1133] ret = -1 [L1134] skip = 0 [L1135] got_new_session = 0 [L1136] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1136] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1137] EXPR s->info_callback [L1137] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1151] EXPR s->cert VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1151] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1184] COND TRUE s->state == 8464 [L1344] s->shutdown = 0 [L1345] ret = __VERIFIER_nondet_int() [L1346] COND TRUE blastFlag == 0 [L1347] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1351] COND FALSE !(ret <= 0) [L1356] got_new_session = 1 [L1357] s->state = 8496 [L1358] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1193] COND TRUE s->state == 8496 [L1362] ret = __VERIFIER_nondet_int() [L1363] COND TRUE blastFlag == 1 [L1364] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1368] COND FALSE !(ret <= 0) [L1373] s->hit VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1373] COND TRUE s->hit [L1374] s->state = 8656 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1378] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1193] COND FALSE !(s->state == 8496) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1196] COND FALSE !(s->state == 8497) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1199] COND FALSE !(s->state == 8512) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1202] COND FALSE !(s->state == 8513) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1205] COND FALSE !(s->state == 8528) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1208] COND FALSE !(s->state == 8529) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1211] COND FALSE !(s->state == 8544) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1214] COND FALSE !(s->state == 8545) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1217] COND FALSE !(s->state == 8560) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1220] COND FALSE !(s->state == 8561) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1223] COND FALSE !(s->state == 8448) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1226] COND FALSE !(s->state == 8576) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1229] COND FALSE !(s->state == 8577) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1232] COND FALSE !(s->state == 8592) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1235] COND FALSE !(s->state == 8593) [L1238] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1238] COND FALSE !(s->state == 8608) [L1241] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1241] COND FALSE !(s->state == 8609) [L1244] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1244] COND FALSE !(s->state == 8640) [L1247] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1247] COND FALSE !(s->state == 8641) [L1250] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1250] COND TRUE s->state == 8656 [L1571] EXPR s->session [L1571] EXPR s->s3 [L1571] EXPR (s->s3)->tmp.new_cipher [L1571] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1572] COND FALSE !(! tmp___9) [L1578] ret = __VERIFIER_nondet_int() [L1579] COND TRUE blastFlag == 2 [L1580] blastFlag = 4 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1588] COND FALSE !(ret <= 0) [L1593] s->state = 8672 [L1594] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1595] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1193] COND FALSE !(s->state == 8496) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1196] COND FALSE !(s->state == 8497) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1199] COND FALSE !(s->state == 8512) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1202] COND FALSE !(s->state == 8513) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1205] COND FALSE !(s->state == 8528) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1208] COND FALSE !(s->state == 8529) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1211] COND FALSE !(s->state == 8544) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1214] COND FALSE !(s->state == 8545) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1217] COND FALSE !(s->state == 8560) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1220] COND FALSE !(s->state == 8561) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1223] COND FALSE !(s->state == 8448) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1226] COND FALSE !(s->state == 8576) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1229] COND FALSE !(s->state == 8577) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1232] COND FALSE !(s->state == 8592) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1235] COND FALSE !(s->state == 8593) [L1238] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1238] COND FALSE !(s->state == 8608) [L1241] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1241] COND FALSE !(s->state == 8609) [L1244] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1244] COND FALSE !(s->state == 8640) [L1247] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1247] COND FALSE !(s->state == 8641) [L1250] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1250] COND FALSE !(s->state == 8656) [L1253] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1253] COND FALSE !(s->state == 8657) [L1256] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1256] COND TRUE s->state == 8672 [L1604] ret = __VERIFIER_nondet_int() [L1605] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1723] 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: 15597.3ms, OverallIterations: 4, TraceHistogramMax: 4, EmptinessCheckTime: 44.6ms, AutomataDifference: 8310.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 789 SDtfs, 668 SDslu, 1530 SDs, 0 SdLazy, 322 SolverSat, 19 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7676.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 541 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 327.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=602occurred 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.0ms DumpTime, AutomataMinimizationStatistics: 136.8ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 213.4ms SsaConstructionTime, 1233.4ms SatisfiabilityAnalysisTime, 3278.7ms 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-10-13 00:13:00,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_420acd97-1e10-4bec-be35-8ff24108a658/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...