./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:22:57,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:22:57,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:22:57,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:22:57,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:22:57,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:22:57,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:22:57,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:22:57,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:22:57,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:22:57,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:22:57,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:22:57,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:22:57,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:22:57,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:22:57,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:22:57,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:22:57,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:22:57,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:22:57,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:22:57,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:22:57,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:22:57,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:22:57,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:22:57,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:22:57,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:22:57,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:22:57,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:22:57,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:22:57,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:22:57,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:22:57,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:22:57,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:22:57,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:22:57,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:22:57,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:22:57,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:22:57,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:22:57,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:22:57,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:22:57,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:22:57,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-06 00:22:57,538 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:22:57,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:22:57,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:22:57,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:22:57,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:22:57,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:22:57,542 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:22:57,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:22:57,543 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 00:22:57,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 00:22:57,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 00:22:57,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:22:57,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:22:57,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:22:57,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:22:57,545 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 00:22:57,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:22:57,545 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:22:57,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:22:57,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:22:57,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:22:57,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:22:57,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:22:57,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:22:57,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:22:57,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:22:57,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 00:22:57,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 00:22:57,554 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:22:57,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:22:57,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:22:57,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:22:57,555 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 [2021-11-06 00:22:57,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:22:57,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:22:57,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:22:57,842 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:22:57,843 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:22:57,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2021-11-06 00:22:57,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57861bb7/b0836dfa736641a1bb3d925809bd78dd/FLAG4c9698c8a [2021-11-06 00:22:58,508 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:22:58,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2021-11-06 00:22:58,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57861bb7/b0836dfa736641a1bb3d925809bd78dd/FLAG4c9698c8a [2021-11-06 00:22:58,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57861bb7/b0836dfa736641a1bb3d925809bd78dd [2021-11-06 00:22:58,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:22:58,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:22:58,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:22:58,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:22:58,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:22:58,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:58" (1/1) ... [2021-11-06 00:22:58,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ed31d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:58, skipping insertion in model container [2021-11-06 00:22:58,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:22:58" (1/1) ... [2021-11-06 00:22:58,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:22:59,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:22:59,371 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2021-11-06 00:22:59,499 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2021-11-06 00:22:59,501 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2021-11-06 00:22:59,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:22:59,540 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:22:59,570 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2021-11-06 00:22:59,630 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2021-11-06 00:22:59,631 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2021-11-06 00:22:59,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:22:59,669 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:22:59,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59 WrapperNode [2021-11-06 00:22:59,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:22:59,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:22:59,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:22:59,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:22:59,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:22:59,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:22:59,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:22:59,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:22:59,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:22:59,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:22:59,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:22:59,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:22:59,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (1/1) ... [2021-11-06 00:22:59,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:22:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:22:59,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 00:23:00,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 00:23:00,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 00:23:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 00:23:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:23:00,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:23:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:23:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 00:23:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:23:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:23:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 00:23:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:23:00,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:23:01,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:23:01,282 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-11-06 00:23:01,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:23:01 BoogieIcfgContainer [2021-11-06 00:23:01,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:23:01,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:23:01,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:23:01,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:23:01,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:22:58" (1/3) ... [2021-11-06 00:23:01,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df973dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:23:01, skipping insertion in model container [2021-11-06 00:23:01,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:22:59" (2/3) ... [2021-11-06 00:23:01,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df973dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:23:01, skipping insertion in model container [2021-11-06 00:23:01,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:23:01" (3/3) ... [2021-11-06 00:23:01,290 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-2.i [2021-11-06 00:23:01,294 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:23:01,295 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 00:23:01,332 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:23:01,338 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 00:23:01,338 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 00:23:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 208 states have (on average 1.7067307692307692) internal successors, (355), 210 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-06 00:23:01,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:01,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:01,361 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-06 00:23:01,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:01,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403348520] [2021-11-06 00:23:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:01,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:01,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:01,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403348520] [2021-11-06 00:23:01,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403348520] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:01,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:01,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 00:23:01,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085058075] [2021-11-06 00:23:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:01,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 00:23:01,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 00:23:01,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:23:01,529 INFO L87 Difference]: Start difference. First operand has 211 states, 208 states have (on average 1.7067307692307692) internal successors, (355), 210 states have internal predecessors, (355), 0 states have call successors, (0), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:01,576 INFO L93 Difference]: Finished difference Result 419 states and 707 transitions. [2021-11-06 00:23:01,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 00:23:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-11-06 00:23:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:01,587 INFO L225 Difference]: With dead ends: 419 [2021-11-06 00:23:01,587 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 00:23:01,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:23:01,594 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.31ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:01,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 2.31ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 00:23:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 00:23:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 00:23:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 176 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-06 00:23:01,633 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-06 00:23:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:01,634 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-06 00:23:01,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-06 00:23:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 00:23:01,635 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:01,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:01,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 00:23:01,635 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-06 00:23:01,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:01,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786066018] [2021-11-06 00:23:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:01,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:01,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:01,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786066018] [2021-11-06 00:23:01,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786066018] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:01,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:01,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:23:01,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533156102] [2021-11-06 00:23:01,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:01,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:23:01,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:23:01,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:01,696 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:01,985 INFO L93 Difference]: Finished difference Result 382 states and 501 transitions. [2021-11-06 00:23:01,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:01,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-06 00:23:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:01,988 INFO L225 Difference]: With dead ends: 382 [2021-11-06 00:23:01,988 INFO L226 Difference]: Without dead ends: 295 [2021-11-06 00:23:01,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.01ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:01,990 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 146 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 215.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.29ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 255.99ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:01,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 564 Invalid, 158 Unknown, 0 Unchecked, 5.29ms Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 255.99ms Time] [2021-11-06 00:23:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-06 00:23:02,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 179. [2021-11-06 00:23:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-06 00:23:02,002 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-06 00:23:02,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:02,002 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-06 00:23:02,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-06 00:23:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:23:02,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:02,005 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:02,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 00:23:02,005 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:02,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-06 00:23:02,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:02,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754834195] [2021-11-06 00:23:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:02,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:02,032 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:23:02,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878191791] [2021-11-06 00:23:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:02,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:02,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:23:02,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 00:23:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:02,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:02,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:02,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:23:02,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:02,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754834195] [2021-11-06 00:23:02,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:23:02,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878191791] [2021-11-06 00:23:02,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878191791] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:02,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:02,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:23:02,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274383943] [2021-11-06 00:23:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:02,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:23:02,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:23:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:02,454 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:02,509 INFO L93 Difference]: Finished difference Result 375 states and 495 transitions. [2021-11-06 00:23:02,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:23:02,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:23:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:02,511 INFO L225 Difference]: With dead ends: 375 [2021-11-06 00:23:02,512 INFO L226 Difference]: Without dead ends: 200 [2021-11-06 00:23:02,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.10ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:02,520 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.99ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.05ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:02,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 409 Invalid, 72 Unknown, 0 Unchecked, 0.99ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 49.05ms Time] [2021-11-06 00:23:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-06 00:23:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2021-11-06 00:23:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 1.2893401015228427) internal successors, (254), 198 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 254 transitions. [2021-11-06 00:23:02,555 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 254 transitions. Word has length 62 [2021-11-06 00:23:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:02,556 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 254 transitions. [2021-11-06 00:23:02,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 254 transitions. [2021-11-06 00:23:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:23:02,559 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:02,560 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:02,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:02,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:02,780 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1305568807, now seen corresponding path program 1 times [2021-11-06 00:23:02,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:02,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650611411] [2021-11-06 00:23:02,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:02,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:02,801 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:23:02,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724072445] [2021-11-06 00:23:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:02,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:02,804 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:23:02,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-06 00:23:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:02,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:02,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:03,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:23:03,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:03,098 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650611411] [2021-11-06 00:23:03,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:23:03,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724072445] [2021-11-06 00:23:03,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724072445] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:03,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:03,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:23:03,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846534895] [2021-11-06 00:23:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:03,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:23:03,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:03,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:23:03,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:03,106 INFO L87 Difference]: Start difference. First operand 199 states and 254 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:03,172 INFO L93 Difference]: Finished difference Result 386 states and 496 transitions. [2021-11-06 00:23:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:03,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:23:03,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:03,174 INFO L225 Difference]: With dead ends: 386 [2021-11-06 00:23:03,174 INFO L226 Difference]: Without dead ends: 191 [2021-11-06 00:23:03,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:03,177 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 220 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.24ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.78ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:03,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 420 Invalid, 66 Unknown, 0 Unchecked, 2.24ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 51.78ms Time] [2021-11-06 00:23:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-06 00:23:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2021-11-06 00:23:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 1.273224043715847) internal successors, (233), 184 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2021-11-06 00:23:03,187 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 62 [2021-11-06 00:23:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:03,187 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2021-11-06 00:23:03,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2021-11-06 00:23:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:23:03,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:03,192 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:03,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:03,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-11-06 00:23:03,408 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-06 00:23:03,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:03,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593641974] [2021-11-06 00:23:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:03,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:03,435 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:23:03,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259687453] [2021-11-06 00:23:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:03,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:03,437 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:23:03,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-06 00:23:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:03,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:23:03,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:03,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:23:03,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:03,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593641974] [2021-11-06 00:23:03,832 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:23:03,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259687453] [2021-11-06 00:23:03,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259687453] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:03,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:03,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:23:03,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989709095] [2021-11-06 00:23:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:03,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:23:03,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:23:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:03,835 INFO L87 Difference]: Start difference. First operand 185 states and 233 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:03,913 INFO L93 Difference]: Finished difference Result 479 states and 602 transitions. [2021-11-06 00:23:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:23:03,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:23:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:03,916 INFO L225 Difference]: With dead ends: 479 [2021-11-06 00:23:03,916 INFO L226 Difference]: Without dead ends: 298 [2021-11-06 00:23:03,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.98ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:03,917 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 105 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.30ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.87ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:03,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 463 Invalid, 32 Unknown, 0 Unchecked, 1.30ms Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 68.87ms Time] [2021-11-06 00:23:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-06 00:23:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2021-11-06 00:23:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 289 states have (on average 1.2664359861591696) internal successors, (366), 290 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 366 transitions. [2021-11-06 00:23:03,925 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 366 transitions. Word has length 62 [2021-11-06 00:23:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:03,925 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 366 transitions. [2021-11-06 00:23:03,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 366 transitions. [2021-11-06 00:23:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 00:23:03,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:03,927 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:03,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:04,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:04,140 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:04,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-06 00:23:04,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:04,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685819262] [2021-11-06 00:23:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:04,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:04,161 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:23:04,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1761267101] [2021-11-06 00:23:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:04,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:04,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:23:04,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-06 00:23:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:04,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:04,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:04,485 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 11 treesize of output 7 [2021-11-06 00:23:04,497 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 15 treesize of output 7 [2021-11-06 00:23:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:23:04,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:23:04,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:04,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685819262] [2021-11-06 00:23:04,508 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:23:04,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761267101] [2021-11-06 00:23:04,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761267101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:04,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:04,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:23:04,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090245055] [2021-11-06 00:23:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:04,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:23:04,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:04,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:23:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:04,510 INFO L87 Difference]: Start difference. First operand 291 states and 366 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:04,832 INFO L93 Difference]: Finished difference Result 379 states and 483 transitions. [2021-11-06 00:23:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:04,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 69 [2021-11-06 00:23:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:04,834 INFO L225 Difference]: With dead ends: 379 [2021-11-06 00:23:04,834 INFO L226 Difference]: Without dead ends: 375 [2021-11-06 00:23:04,834 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:04,835 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 135 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 271.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.23ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 304.18ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:04,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 564 Invalid, 137 Unknown, 0 Unchecked, 2.23ms Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 304.18ms Time] [2021-11-06 00:23:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-06 00:23:04,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 293. [2021-11-06 00:23:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 291 states have (on average 1.2646048109965635) internal successors, (368), 292 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2021-11-06 00:23:04,842 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 69 [2021-11-06 00:23:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:04,842 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2021-11-06 00:23:04,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2021-11-06 00:23:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:23:04,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:04,843 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:04,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:05,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:05,044 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2000986198, now seen corresponding path program 1 times [2021-11-06 00:23:05,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:05,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724340045] [2021-11-06 00:23:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:05,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:05,059 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:23:05,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337926574] [2021-11-06 00:23:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:05,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:05,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:05,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:23:05,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-06 00:23:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:05,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:05,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:23:05,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:23:05,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:05,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724340045] [2021-11-06 00:23:05,414 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:23:05,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337926574] [2021-11-06 00:23:05,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337926574] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:05,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:05,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 00:23:05,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352112780] [2021-11-06 00:23:05,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:05,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:23:05,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:23:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:05,416 INFO L87 Difference]: Start difference. First operand 293 states and 368 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:05,479 INFO L93 Difference]: Finished difference Result 483 states and 627 transitions. [2021-11-06 00:23:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:23:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:23:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:05,481 INFO L225 Difference]: With dead ends: 483 [2021-11-06 00:23:05,481 INFO L226 Difference]: Without dead ends: 335 [2021-11-06 00:23:05,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:05,482 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.95ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.31ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:05,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 395 Invalid, 72 Unknown, 0 Unchecked, 0.95ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 54.31ms Time] [2021-11-06 00:23:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-06 00:23:05,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2021-11-06 00:23:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 332 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 408 transitions. [2021-11-06 00:23:05,490 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 408 transitions. Word has length 103 [2021-11-06 00:23:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:05,490 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 408 transitions. [2021-11-06 00:23:05,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 408 transitions. [2021-11-06 00:23:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:23:05,491 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:05,492 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:05,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:05,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:05,700 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1973776046, now seen corresponding path program 1 times [2021-11-06 00:23:05,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:05,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699302870] [2021-11-06 00:23:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:05,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:05,716 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:23:05,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109853938] [2021-11-06 00:23:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:05,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:05,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:05,722 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:23:05,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-06 00:23:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:05,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:05,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-06 00:23:06,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:23:06,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:06,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699302870] [2021-11-06 00:23:06,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:23:06,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109853938] [2021-11-06 00:23:06,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109853938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:06,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:06,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:23:06,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140877447] [2021-11-06 00:23:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:06,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:23:06,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:06,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:23:06,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:06,076 INFO L87 Difference]: Start difference. First operand 333 states and 408 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:06,136 INFO L93 Difference]: Finished difference Result 498 states and 622 transitions. [2021-11-06 00:23:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:06,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:23:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:06,140 INFO L225 Difference]: With dead ends: 498 [2021-11-06 00:23:06,140 INFO L226 Difference]: Without dead ends: 310 [2021-11-06 00:23:06,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:06,141 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 103 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.56ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.61ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:06,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 510 Invalid, 66 Unknown, 0 Unchecked, 1.56ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 44.61ms Time] [2021-11-06 00:23:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-06 00:23:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 305. [2021-11-06 00:23:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 303 states have (on average 1.2079207920792079) internal successors, (366), 304 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2021-11-06 00:23:06,149 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 103 [2021-11-06 00:23:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:06,150 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2021-11-06 00:23:06,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2021-11-06 00:23:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-06 00:23:06,151 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:06,151 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:06,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:06,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:06,364 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1090927200, now seen corresponding path program 1 times [2021-11-06 00:23:06,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:06,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301134204] [2021-11-06 00:23:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:06,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:06,376 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:23:06,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226927727] [2021-11-06 00:23:06,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:06,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:06,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:06,378 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:23:06,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-06 00:23:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:06,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:23:06,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:06,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-06 00:23:06,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:06,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301134204] [2021-11-06 00:23:06,783 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:23:06,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226927727] [2021-11-06 00:23:06,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226927727] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:06,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:06,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 00:23:06,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25005941] [2021-11-06 00:23:06,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:06,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:23:06,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 00:23:06,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:23:06,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:06,786 INFO L87 Difference]: Start difference. First operand 305 states and 366 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:06,981 INFO L93 Difference]: Finished difference Result 653 states and 790 transitions. [2021-11-06 00:23:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:06,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-11-06 00:23:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:06,983 INFO L225 Difference]: With dead ends: 653 [2021-11-06 00:23:06,984 INFO L226 Difference]: Without dead ends: 396 [2021-11-06 00:23:06,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:06,986 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 416 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 117.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.01ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 155.04ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:06,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 365 Invalid, 77 Unknown, 0 Unchecked, 4.01ms Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 155.04ms Time] [2021-11-06 00:23:06,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-06 00:23:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2021-11-06 00:23:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 387 states have (on average 1.2144702842377262) internal successors, (470), 388 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 470 transitions. [2021-11-06 00:23:07,014 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 470 transitions. Word has length 103 [2021-11-06 00:23:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:07,014 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 470 transitions. [2021-11-06 00:23:07,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 470 transitions. [2021-11-06 00:23:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-06 00:23:07,015 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:07,015 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:07,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:07,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:07,232 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash 541561274, now seen corresponding path program 1 times [2021-11-06 00:23:07,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 00:23:07,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801328063] [2021-11-06 00:23:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:07,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 00:23:07,244 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-06 00:23:07,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984362423] [2021-11-06 00:23:07,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:07,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 00:23:07,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:07,246 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-06 00:23:07,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-06 00:23:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:07,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-06 00:23:07,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:07,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-11-06 00:23:07,418 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 11 treesize of output 7 [2021-11-06 00:23:07,460 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-06 00:23:07,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-06 00:23:07,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:07,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:07,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2021-11-06 00:23:08,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2021-11-06 00:23:08,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2021-11-06 00:23:08,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2021-11-06 00:23:08,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2021-11-06 00:23:08,631 INFO L354 Elim1Store]: treesize reduction 70, result has 23.1 percent of original size [2021-11-06 00:23:08,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 52 [2021-11-06 00:23:08,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:08,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-06 00:23:08,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 00:23:10,132 INFO L354 Elim1Store]: treesize reduction 364, result has 11.9 percent of original size [2021-11-06 00:23:10,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 2853 treesize of output 2296 [2021-11-06 00:23:10,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:10,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:10,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 00:23:15,184 WARN L230 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 354 DAG size of output: 88 [2021-11-06 00:23:15,185 INFO L354 Elim1Store]: treesize reduction 7776, result has 3.0 percent of original size [2021-11-06 00:23:15,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 3322 treesize of output 1825 [2021-11-06 00:23:15,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 00:23:15,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801328063] [2021-11-06 00:23:15,258 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-06 00:23:15,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984362423] [2021-11-06 00:23:15,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-06 00:23:15,259 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:15,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-06 00:23:15,259 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-06 00:23:15,260 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-06 00:23:15,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-06 00:23:15,269 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-06 00:23:15,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:15,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-06 00:23:15,486 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:15,488 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 00:23:15,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:23:15 BoogieIcfgContainer [2021-11-06 00:23:15,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 00:23:15,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 00:23:15,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 00:23:15,514 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 00:23:15,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:23:01" (3/4) ... [2021-11-06 00:23:15,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 00:23:15,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 00:23:15,517 INFO L158 Benchmark]: Toolchain (without parser) took 16590.34ms. Allocated memory was 54.5MB in the beginning and 134.2MB in the end (delta: 79.7MB). Free memory was 29.0MB in the beginning and 49.4MB in the end (delta: -20.4MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2021-11-06 00:23:15,517 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:23:15,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 742.22ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 28.7MB in the beginning and 46.4MB in the end (delta: -17.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2021-11-06 00:23:15,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.85ms. Allocated memory is still 73.4MB. Free memory was 46.4MB in the beginning and 39.3MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-06 00:23:15,518 INFO L158 Benchmark]: Boogie Preprocessor took 145.74ms. Allocated memory is still 73.4MB. Free memory was 39.3MB in the beginning and 47.7MB in the end (delta: -8.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2021-11-06 00:23:15,519 INFO L158 Benchmark]: RCFGBuilder took 1326.35ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 47.7MB in the beginning and 54.5MB in the end (delta: -6.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2021-11-06 00:23:15,519 INFO L158 Benchmark]: TraceAbstraction took 14227.98ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 54.1MB in the beginning and 50.4MB in the end (delta: 3.8MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2021-11-06 00:23:15,519 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 134.2MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-06 00:23:15,520 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.17ms. Allocated memory is still 54.5MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 742.22ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 28.7MB in the beginning and 46.4MB in the end (delta: -17.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.85ms. Allocated memory is still 73.4MB. Free memory was 46.4MB in the beginning and 39.3MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.74ms. Allocated memory is still 73.4MB. Free memory was 39.3MB in the beginning and 47.7MB in the end (delta: -8.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1326.35ms. Allocated memory was 73.4MB in the beginning and 92.3MB in the end (delta: 18.9MB). Free memory was 47.7MB in the beginning and 54.5MB in the end (delta: -6.9MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 14227.98ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 54.1MB in the beginning and 50.4MB in the end (delta: 3.8MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 134.2MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 730]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of bitwiseXor at line 725, overapproximation of bitwiseAnd at line 725. Possible FailurePath: [L713] int i; [L714] example_user_t *user, *tmp, *users=((void *)0); [L715] i=0 [L715] EXPR \read(i) [L715] COND TRUE i<1000 [L716] user = (example_user_t*)malloc(sizeof(example_user_t)) [L717] COND FALSE !(user == ((void *)0)) [L720] EXPR \read(i) [L720] user->id = i [L721] EXPR \read(i) [L721] EXPR \read(i) [L721] user->cookie = i*i [L722] unsigned _ha_hashv; [L722] unsigned _hj_i,_hj_j,_hj_k; [L722] unsigned const char *_hj_key=(unsigned const char*)(&((user)->id)); [L722] _ha_hashv = 0xfeedbeefu [L722] EXPR _hj_j = 0x9e3779b9u [L722] _hj_i = _hj_j = 0x9e3779b9u [L722] _hj_k = (unsigned)(sizeof(int)) [L722] COND FALSE !(_hj_k >= 12U) [L722] _ha_hashv += (unsigned)(sizeof(int)) [L722] case 11: [L722] case 10: [L722] case 9: [L722] case 8: [L722] case 7: [L722] case 6: [L722] case 5: [L722] case 4: [L722] EXPR _hj_key[3] [L722] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L722] case 3: [L722] EXPR _hj_key[2] [L722] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L722] case 2: [L722] EXPR _hj_key[1] [L722] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L722] case 1: [L722] EXPR _hj_key[0] [L722] _hj_i += _hj_key[0] [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 13 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 8 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 13 ) [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 12 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 16 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 5 ) [L722] _hj_i -= _hj_j [L722] _hj_i -= _ha_hashv [L722] _hj_i ^= ( _ha_hashv >> 3 ) [L722] _hj_j -= _ha_hashv [L722] _hj_j -= _hj_i [L722] _hj_j ^= ( _hj_i << 10 ) [L722] _ha_hashv -= _hj_i [L722] _ha_hashv -= _hj_j [L722] _ha_hashv ^= ( _hj_j >> 15 ) [L722] (user)->hh.hashv = (_ha_hashv) [L722] (user)->hh.key = (char*) (&((user)->id)) [L722] (user)->hh.keylen = (unsigned) (sizeof(int)) [L722] COND TRUE !(users) [L722] (user)->hh.next = ((void *)0) [L722] (user)->hh.prev = ((void *)0) [L722] (user)->hh.tbl = (UT_hash_table*)malloc(sizeof(UT_hash_table)) [L722] EXPR (user)->hh.tbl [L722] COND FALSE !(!(user)->hh.tbl) [L722] (user)->hh.tbl [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->tail = &((user)->hh) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->num_buckets = 32U [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->log2_num_buckets = 5U [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->hho = (char*)(&(user)->hh) - (char*)(user) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->buckets = (UT_hash_bucket*)malloc(32U * sizeof(struct UT_hash_bucket)) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->signature = 0xa0111fe1u [L722] EXPR (user)->hh.tbl [L722] EXPR (user)->hh.tbl->buckets [L722] COND FALSE !(!(user)->hh.tbl->buckets) [L722] EXPR (user)->hh.tbl [L722] (user)->hh.tbl->buckets [L722] (users) = (user) [L722] unsigned _ha_bkt; [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->num_items [L722] (users)->hh.tbl->num_items++ [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->num_buckets [L722] _ha_bkt = ((_ha_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L722] EXPR (users)->hh.tbl [L722] EXPR (users)->hh.tbl->buckets [L722] UT_hash_bucket *_ha_head = &((users)->hh.tbl->buckets[_ha_bkt]); [L722] EXPR _ha_head->count [L722] _ha_head->count++ [L722] EXPR _ha_head->hh_head [L722] (&(user)->hh)->hh_next = _ha_head->hh_head [L722] (&(user)->hh)->hh_prev = ((void *)0) [L722] EXPR _ha_head->hh_head [L722] COND FALSE !(_ha_head->hh_head != ((void *)0)) [L722] _ha_head->hh_head = (&(user)->hh) [L722] EXPR _ha_head->count [L722] EXPR _ha_head->expand_mult [L722] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L722] EXPR (&(user)->hh)->tbl [L722] EXPR (&(user)->hh)->tbl->noexpand [L722] (_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand [L722] COND FALSE !((_ha_head->count >= ((_ha_head->expand_mult + 1U) * 10U)) && !(&(user)->hh)->tbl->noexpand) [L715] EXPR \read(i) [L715] i++ [L715] EXPR \read(i) [L715] COND FALSE !(i<1000) [L724] i=0 [L724] EXPR \read(i) [L724] COND TRUE i<1000 [L725] unsigned _hf_hashv; [L725] unsigned _hj_i,_hj_j,_hj_k; [L725] unsigned const char *_hj_key=(unsigned const char*)(&i); [L725] _hf_hashv = 0xfeedbeefu [L725] EXPR _hj_j = 0x9e3779b9u [L725] _hj_i = _hj_j = 0x9e3779b9u [L725] _hj_k = (unsigned)(sizeof(int)) [L725] COND FALSE !(_hj_k >= 12U) [L725] _hf_hashv += (unsigned)(sizeof(int)) [L725] case 11: [L725] case 10: [L725] case 9: [L725] case 8: [L725] case 7: [L725] case 6: [L725] case 5: [L725] case 4: [L725] EXPR _hj_key[3] [L725] _hj_i += ( (unsigned)_hj_key[3] << 24 ) [L725] case 3: [L725] EXPR _hj_key[2] [L725] _hj_i += ( (unsigned)_hj_key[2] << 16 ) [L725] case 2: [L725] EXPR _hj_key[1] [L725] _hj_i += ( (unsigned)_hj_key[1] << 8 ) [L725] case 1: [L725] EXPR _hj_key[0] [L725] _hj_i += _hj_key[0] [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 13 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 8 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 13 ) [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 12 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 16 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 5 ) [L725] _hj_i -= _hj_j [L725] _hj_i -= _hf_hashv [L725] _hj_i ^= ( _hf_hashv >> 3 ) [L725] _hj_j -= _hf_hashv [L725] _hj_j -= _hj_i [L725] _hj_j ^= ( _hj_i << 10 ) [L725] _hf_hashv -= _hj_i [L725] _hf_hashv -= _hj_j [L725] _hf_hashv ^= ( _hj_j >> 15 ) [L725] (tmp) = ((void *)0) [L725] COND TRUE \read(*users) [L725] unsigned _hf_bkt; [L725] EXPR (users)->hh.tbl [L725] EXPR (users)->hh.tbl->num_buckets [L725] _hf_bkt = ((_hf_hashv) & (((users)->hh.tbl->num_buckets) - 1U)) [L725] EXPR (users)->hh.tbl [L725] EXPR (users)->hh.tbl->buckets [L725] EXPR ((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head [L725] COND FALSE !(((users)->hh.tbl->buckets[ _hf_bkt ]).hh_head != ((void *)0)) [L725] (tmp) = ((void *)0) [L725] COND FALSE !((tmp) != ((void *)0)) [L726] COND FALSE !(tmp != ((void *)0)) [L730] reach_error() - UnprovableResult [Line: 734]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 211 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 14156.12ms, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 22.33ms, AutomataDifference: 1280.33ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 12.26ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1143 SdHoareTripleChecker+Valid, 983.84ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1143 mSDsluCounter, 3966 SdHoareTripleChecker+Invalid, 822.12ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1958 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 2008 mSDtfsCounter, 561 mSolverCounterSat, 20.87ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.66ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=9, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 128.13ms AutomataMinimizationTime, 9 MinimizatonAttempts, 226 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 443.38ms SsaConstructionTime, 417.12ms SatisfiabilityAnalysisTime, 9262.40ms InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2243 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-06 00:23:15,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-06 00:23:17,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 00:23:17,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 00:23:17,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 00:23:17,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 00:23:17,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 00:23:17,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 00:23:17,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 00:23:17,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 00:23:17,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 00:23:17,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 00:23:17,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 00:23:17,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 00:23:17,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 00:23:17,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 00:23:17,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 00:23:17,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 00:23:17,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 00:23:17,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 00:23:17,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 00:23:17,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 00:23:17,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 00:23:17,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 00:23:17,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 00:23:17,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 00:23:17,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 00:23:17,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 00:23:17,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 00:23:17,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 00:23:17,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 00:23:17,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 00:23:17,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 00:23:17,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 00:23:17,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 00:23:17,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 00:23:17,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 00:23:17,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 00:23:17,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 00:23:17,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 00:23:17,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 00:23:17,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 00:23:17,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-06 00:23:17,575 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 00:23:17,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 00:23:17,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 00:23:17,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 00:23:17,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 00:23:17,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 00:23:17,579 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 00:23:17,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 00:23:17,580 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-06 00:23:17,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-06 00:23:17,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 00:23:17,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 00:23:17,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 00:23:17,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 00:23:17,581 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 00:23:17,582 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 00:23:17,582 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-06 00:23:17,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 00:23:17,582 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 00:23:17,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 00:23:17,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 00:23:17,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 00:23:17,583 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 00:23:17,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:23:17,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 00:23:17,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 00:23:17,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 00:23:17,593 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 00:23:17,594 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 00:23:17,594 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 00:23:17,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 00:23:17,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 00:23:17,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 00:23:17,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 00:23:17,595 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> 99f48cdcb9a25adc64e4307e90599f4e37a0b97f677ff29ab3d60f24a1c8e980 [2021-11-06 00:23:17,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 00:23:17,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 00:23:17,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 00:23:17,966 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 00:23:17,967 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 00:23:17,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2021-11-06 00:23:18,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6e6be66/83529b2679c941f6a3f9283adff882a2/FLAG471a23e08 [2021-11-06 00:23:18,612 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 00:23:18,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i [2021-11-06 00:23:18,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6e6be66/83529b2679c941f6a3f9283adff882a2/FLAG471a23e08 [2021-11-06 00:23:19,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a6e6be66/83529b2679c941f6a3f9283adff882a2 [2021-11-06 00:23:19,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 00:23:19,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 00:23:19,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 00:23:19,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 00:23:19,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 00:23:19,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:19,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1fdb0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19, skipping insertion in model container [2021-11-06 00:23:19,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:19,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 00:23:19,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 00:23:19,478 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2021-11-06 00:23:19,629 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2021-11-06 00:23:19,630 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2021-11-06 00:23:19,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:23:19,671 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 00:23:19,702 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[33021,33034] [2021-11-06 00:23:19,758 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44124,44137] [2021-11-06 00:23:19,759 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-2.i[44245,44258] [2021-11-06 00:23:19,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 00:23:19,812 INFO L208 MainTranslator]: Completed translation [2021-11-06 00:23:19,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19 WrapperNode [2021-11-06 00:23:19,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 00:23:19,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 00:23:19,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 00:23:19,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 00:23:19,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:19,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:19,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 00:23:19,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 00:23:19,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 00:23:19,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 00:23:19,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:19,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:20,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:20,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:20,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:20,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:20,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:20,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 00:23:20,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 00:23:20,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 00:23:20,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 00:23:20,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (1/1) ... [2021-11-06 00:23:20,100 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 00:23:20,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 00:23:20,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-06 00:23:20,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-06 00:23:20,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 00:23:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 00:23:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 00:23:20,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 00:23:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 00:23:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-06 00:23:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 00:23:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 00:23:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 00:23:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 00:23:20,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 00:23:20,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 00:23:24,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 00:23:24,692 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-11-06 00:23:24,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:23:24 BoogieIcfgContainer [2021-11-06 00:23:24,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 00:23:24,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 00:23:24,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 00:23:24,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 00:23:24,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:23:19" (1/3) ... [2021-11-06 00:23:24,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2780eb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:23:24, skipping insertion in model container [2021-11-06 00:23:24,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:23:19" (2/3) ... [2021-11-06 00:23:24,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2780eb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:23:24, skipping insertion in model container [2021-11-06 00:23:24,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:23:24" (3/3) ... [2021-11-06 00:23:24,700 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-2.i [2021-11-06 00:23:24,705 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 00:23:24,705 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-06 00:23:24,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 00:23:24,750 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 00:23:24,751 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-06 00:23:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 208 states have (on average 1.7067307692307692) internal successors, (355), 210 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-06 00:23:24,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:24,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:24,773 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-06 00:23:24,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:24,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829715905] [2021-11-06 00:23:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:24,803 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:24,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:24,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:24,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-06 00:23:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:24,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-06 00:23:24,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:25,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:25,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:25,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:25,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829715905] [2021-11-06 00:23:25,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829715905] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:25,081 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:25,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 00:23:25,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792168612] [2021-11-06 00:23:25,083 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:25,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-06 00:23:25,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:25,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-06 00:23:25,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:23:25,134 INFO L87 Difference]: Start difference. First operand has 211 states, 208 states have (on average 1.7067307692307692) internal successors, (355), 210 states have internal predecessors, (355), 0 states have call successors, (0), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:25,172 INFO L93 Difference]: Finished difference Result 419 states and 707 transitions. [2021-11-06 00:23:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-06 00:23:25,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-11-06 00:23:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:25,184 INFO L225 Difference]: With dead ends: 419 [2021-11-06 00:23:25,184 INFO L226 Difference]: Without dead ends: 177 [2021-11-06 00:23:25,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.09ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-06 00:23:25,190 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.82ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:25,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 2.82ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-06 00:23:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-06 00:23:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-06 00:23:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 176 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-06 00:23:25,227 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-06 00:23:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:25,228 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-06 00:23:25,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-06 00:23:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-06 00:23:25,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:25,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:25,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:25,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:25,437 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-06 00:23:25,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:25,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546011389] [2021-11-06 00:23:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:25,439 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:25,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:25,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-06 00:23:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:25,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:25,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:25,699 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 11 treesize of output 7 [2021-11-06 00:23:25,774 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 15 treesize of output 7 [2021-11-06 00:23:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:25,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:25,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:25,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546011389] [2021-11-06 00:23:25,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546011389] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:25,876 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:25,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 00:23:25,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833162251] [2021-11-06 00:23:25,876 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:25,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:23:25,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:25,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:23:25,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:23:25,879 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:28,107 INFO L93 Difference]: Finished difference Result 468 states and 614 transitions. [2021-11-06 00:23:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 00:23:28,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 10 [2021-11-06 00:23:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:28,111 INFO L225 Difference]: With dead ends: 468 [2021-11-06 00:23:28,112 INFO L226 Difference]: Without dead ends: 381 [2021-11-06 00:23:28,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 38.91ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 00:23:28,113 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 396 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1953.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.26ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2167.07ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:28,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 652 Invalid, 206 Unknown, 0 Unchecked, 9.26ms Time], IncrementalHoareTripleChecker [8 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 2167.07ms Time] [2021-11-06 00:23:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-06 00:23:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 179. [2021-11-06 00:23:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 178 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-06 00:23:28,128 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-06 00:23:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:28,129 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-06 00:23:28,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-06 00:23:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:23:28,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:28,131 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:28,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:28,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:28,351 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:28,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-06 00:23:28,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:28,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119538999] [2021-11-06 00:23:28,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:28,353 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:28,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:28,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:28,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-06 00:23:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:28,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:28,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:28,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:28,935 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:28,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119538999] [2021-11-06 00:23:28,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119538999] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:28,935 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:28,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:23:28,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651084977] [2021-11-06 00:23:28,936 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:28,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:23:28,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:28,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:23:28,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:28,937 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:29,059 INFO L93 Difference]: Finished difference Result 363 states and 476 transitions. [2021-11-06 00:23:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:29,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:23:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:29,063 INFO L225 Difference]: With dead ends: 363 [2021-11-06 00:23:29,063 INFO L226 Difference]: Without dead ends: 188 [2021-11-06 00:23:29,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.02ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:23:29,068 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 217 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.92ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.66ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:29,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 423 Invalid, 69 Unknown, 0 Unchecked, 1.92ms Time], IncrementalHoareTripleChecker [30 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 103.66ms Time] [2021-11-06 00:23:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-06 00:23:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2021-11-06 00:23:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 180 states have (on average 1.2722222222222221) internal successors, (229), 181 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2021-11-06 00:23:29,087 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 62 [2021-11-06 00:23:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:29,087 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2021-11-06 00:23:29,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2021-11-06 00:23:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-06 00:23:29,089 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:29,089 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:29,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:29,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:29,303 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-06 00:23:29,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:29,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304228351] [2021-11-06 00:23:29,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:29,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:29,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:29,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:29,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-06 00:23:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:29,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:29,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:29,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:30,246 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:30,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304228351] [2021-11-06 00:23:30,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304228351] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:30,246 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:30,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 00:23:30,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330926084] [2021-11-06 00:23:30,247 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:30,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 00:23:30,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:30,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 00:23:30,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:30,248 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:31,140 INFO L93 Difference]: Finished difference Result 470 states and 590 transitions. [2021-11-06 00:23:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:23:31,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-06 00:23:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:31,142 INFO L225 Difference]: With dead ends: 470 [2021-11-06 00:23:31,142 INFO L226 Difference]: Without dead ends: 292 [2021-11-06 00:23:31,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.20ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 00:23:31,144 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 101 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 819.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.00ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 876.24ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:31,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 451 Invalid, 36 Unknown, 0 Unchecked, 2.00ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 876.24ms Time] [2021-11-06 00:23:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-06 00:23:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 285. [2021-11-06 00:23:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 283 states have (on average 1.265017667844523) internal successors, (358), 284 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 358 transitions. [2021-11-06 00:23:31,156 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 358 transitions. Word has length 62 [2021-11-06 00:23:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:31,157 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 358 transitions. [2021-11-06 00:23:31,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 358 transitions. [2021-11-06 00:23:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-06 00:23:31,159 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:31,159 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:31,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:31,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:31,373 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:31,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-06 00:23:31,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:31,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596184621] [2021-11-06 00:23:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:31,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:31,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:31,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:31,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-06 00:23:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:31,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:31,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:31,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 00:23:31,865 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:31,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596184621] [2021-11-06 00:23:31,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596184621] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:31,865 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:31,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 00:23:31,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669964026] [2021-11-06 00:23:31,865 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:31,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:23:31,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:23:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:31,867 INFO L87 Difference]: Start difference. First operand 285 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:31,944 INFO L93 Difference]: Finished difference Result 528 states and 673 transitions. [2021-11-06 00:23:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:31,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 69 [2021-11-06 00:23:31,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:31,947 INFO L225 Difference]: With dead ends: 528 [2021-11-06 00:23:31,947 INFO L226 Difference]: Without dead ends: 288 [2021-11-06 00:23:31,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.24ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:23:31,949 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.99ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.65ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:31,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 14 Unknown, 0 Unchecked, 0.99ms Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 67.65ms Time] [2021-11-06 00:23:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-06 00:23:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-11-06 00:23:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 286 states have (on average 1.2622377622377623) internal successors, (361), 287 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 361 transitions. [2021-11-06 00:23:31,960 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 361 transitions. Word has length 69 [2021-11-06 00:23:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:31,961 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 361 transitions. [2021-11-06 00:23:31,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 361 transitions. [2021-11-06 00:23:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-06 00:23:31,968 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:31,968 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:31,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:32,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:32,183 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:32,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash 982130832, now seen corresponding path program 1 times [2021-11-06 00:23:32,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:32,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640661449] [2021-11-06 00:23:32,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:32,185 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:32,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:32,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:32,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-06 00:23:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:32,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:23:32,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 00:23:32,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-06 00:23:32,801 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:32,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640661449] [2021-11-06 00:23:32,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640661449] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:23:32,802 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:23:32,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-06 00:23:32,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032210293] [2021-11-06 00:23:32,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:23:32,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 00:23:32,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:32,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 00:23:32,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:23:32,803 INFO L87 Difference]: Start difference. First operand 288 states and 361 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:33,092 INFO L93 Difference]: Finished difference Result 537 states and 685 transitions. [2021-11-06 00:23:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-06 00:23:33,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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 72 [2021-11-06 00:23:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:33,094 INFO L225 Difference]: With dead ends: 537 [2021-11-06 00:23:33,095 INFO L226 Difference]: Without dead ends: 294 [2021-11-06 00:23:33,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 175.18ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-06 00:23:33,096 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 161.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 185.12ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:33,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 855 Invalid, 50 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 185.12ms Time] [2021-11-06 00:23:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-06 00:23:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-06 00:23:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 292 states have (on average 1.2568493150684932) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2021-11-06 00:23:33,106 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 72 [2021-11-06 00:23:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:33,106 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2021-11-06 00:23:33,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2021-11-06 00:23:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 00:23:33,107 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:33,107 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:33,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:33,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:33,321 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2058438736, now seen corresponding path program 2 times [2021-11-06 00:23:33,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:33,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737231184] [2021-11-06 00:23:33,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:23:33,322 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:33,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:33,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:33,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-06 00:23:33,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:23:33,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:23:33,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:33,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:33,552 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 11 treesize of output 7 [2021-11-06 00:23:33,566 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 15 treesize of output 7 [2021-11-06 00:23:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:23:33,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-06 00:23:33,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:33,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737231184] [2021-11-06 00:23:33,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737231184] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:33,723 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:33,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 00:23:33,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097467701] [2021-11-06 00:23:33,723 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:33,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 00:23:33,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:33,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 00:23:33,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:23:33,725 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:35,965 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:23:38,381 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:23:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:38,958 INFO L93 Difference]: Finished difference Result 448 states and 571 transitions. [2021-11-06 00:23:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 00:23:38,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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 78 [2021-11-06 00:23:38,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:38,961 INFO L225 Difference]: With dead ends: 448 [2021-11-06 00:23:38,961 INFO L226 Difference]: Without dead ends: 444 [2021-11-06 00:23:38,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.56ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 00:23:38,963 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 207 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4949.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.34ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5184.72ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:38,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 927 Invalid, 274 Unknown, 0 Unchecked, 5.34ms Time], IncrementalHoareTripleChecker [6 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 5184.72ms Time] [2021-11-06 00:23:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-06 00:23:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 365. [2021-11-06 00:23:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 363 states have (on average 1.2754820936639117) internal successors, (463), 364 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 463 transitions. [2021-11-06 00:23:38,976 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 463 transitions. Word has length 78 [2021-11-06 00:23:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:38,976 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 463 transitions. [2021-11-06 00:23:38,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 463 transitions. [2021-11-06 00:23:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-06 00:23:38,977 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:38,978 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:38,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:39,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:39,188 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1224331210, now seen corresponding path program 1 times [2021-11-06 00:23:39,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:39,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981083045] [2021-11-06 00:23:39,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:39,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:39,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:39,190 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:39,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-06 00:23:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:39,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 00:23:39,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:23:39,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 00:23:40,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:40,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981083045] [2021-11-06 00:23:40,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981083045] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:23:40,341 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:23:40,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-06 00:23:40,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617488281] [2021-11-06 00:23:40,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:23:40,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-06 00:23:40,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:40,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-06 00:23:40,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-06 00:23:40,342 INFO L87 Difference]: Start difference. First operand 365 states and 463 transitions. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:41,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:41,870 INFO L93 Difference]: Finished difference Result 697 states and 901 transitions. [2021-11-06 00:23:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 00:23:41,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 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 112 [2021-11-06 00:23:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:41,874 INFO L225 Difference]: With dead ends: 697 [2021-11-06 00:23:41,874 INFO L226 Difference]: Without dead ends: 377 [2021-11-06 00:23:41,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 884.33ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-06 00:23:41,876 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 911.27ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.90ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 996.25ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:41,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1703 Invalid, 158 Unknown, 0 Unchecked, 3.90ms Time], IncrementalHoareTripleChecker [45 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 996.25ms Time] [2021-11-06 00:23:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-06 00:23:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-11-06 00:23:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.2666666666666666) internal successors, (475), 376 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 475 transitions. [2021-11-06 00:23:41,889 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 475 transitions. Word has length 112 [2021-11-06 00:23:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:41,890 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 475 transitions. [2021-11-06 00:23:41,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 475 transitions. [2021-11-06 00:23:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 00:23:41,891 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:41,892 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:41,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:42,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:42,107 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:42,107 INFO L85 PathProgramCache]: Analyzing trace with hash -2016870474, now seen corresponding path program 2 times [2021-11-06 00:23:42,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:42,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93112976] [2021-11-06 00:23:42,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:23:42,108 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:42,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:42,110 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:42,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-06 00:23:42,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:23:42,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:23:42,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:23:42,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 00:23:42,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2021-11-06 00:23:42,633 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:42,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93112976] [2021-11-06 00:23:42,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93112976] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:42,633 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:42,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-06 00:23:42,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764837963] [2021-11-06 00:23:42,633 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:42,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:23:42,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:42,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:23:42,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:42,634 INFO L87 Difference]: Start difference. First operand 377 states and 475 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:42,752 INFO L93 Difference]: Finished difference Result 603 states and 784 transitions. [2021-11-06 00:23:42,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:23:42,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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 124 [2021-11-06 00:23:42,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:42,755 INFO L225 Difference]: With dead ends: 603 [2021-11-06 00:23:42,755 INFO L226 Difference]: Without dead ends: 389 [2021-11-06 00:23:42,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.00ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-06 00:23:42,756 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 101 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.33ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.45ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:42,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 604 Invalid, 68 Unknown, 0 Unchecked, 1.33ms Time], IncrementalHoareTripleChecker [30 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 85.45ms Time] [2021-11-06 00:23:42,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-06 00:23:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2021-11-06 00:23:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 384 states have (on average 1.1979166666666667) internal successors, (460), 385 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2021-11-06 00:23:42,769 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 124 [2021-11-06 00:23:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:42,769 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2021-11-06 00:23:42,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2021-11-06 00:23:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-06 00:23:42,776 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:42,776 INFO L514 BasicCegarLoop]: trace histogram [14, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:42,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:42,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:42,987 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1333208362, now seen corresponding path program 1 times [2021-11-06 00:23:42,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:42,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547309527] [2021-11-06 00:23:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:42,988 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:42,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:42,989 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:42,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-06 00:23:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:43,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-06 00:23:43,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 00:23:43,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-06 00:23:44,965 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:44,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547309527] [2021-11-06 00:23:44,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547309527] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:23:44,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:23:44,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-06 00:23:44,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408100116] [2021-11-06 00:23:44,965 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:23:44,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-06 00:23:44,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:44,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-06 00:23:44,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-11-06 00:23:44,967 INFO L87 Difference]: Start difference. First operand 386 states and 460 transitions. Second operand has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:54,459 INFO L93 Difference]: Finished difference Result 751 states and 919 transitions. [2021-11-06 00:23:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-06 00:23:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 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 124 [2021-11-06 00:23:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:54,462 INFO L225 Difference]: With dead ends: 751 [2021-11-06 00:23:54,463 INFO L226 Difference]: Without dead ends: 410 [2021-11-06 00:23:54,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4142.43ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-11-06 00:23:54,465 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6115.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3826 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.75ms SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6361.61ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:54,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3826 Invalid, 536 Unknown, 0 Unchecked, 9.75ms Time], IncrementalHoareTripleChecker [157 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 6361.61ms Time] [2021-11-06 00:23:54,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-06 00:23:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-11-06 00:23:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1862745098039216) internal successors, (484), 409 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2021-11-06 00:23:54,480 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 124 [2021-11-06 00:23:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:54,480 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2021-11-06 00:23:54,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.1875) internal successors, (134), 32 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2021-11-06 00:23:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 00:23:54,482 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:54,482 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:54,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-06 00:23:54,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:54,699 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:54,700 INFO L85 PathProgramCache]: Analyzing trace with hash -2039593942, now seen corresponding path program 2 times [2021-11-06 00:23:54,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:54,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303975832] [2021-11-06 00:23:54,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:23:54,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:54,702 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:54,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-06 00:23:54,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-06 00:23:54,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:23:54,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 00:23:54,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:55,114 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 00:23:55,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2021-11-06 00:23:55,363 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:55,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303975832] [2021-11-06 00:23:55,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303975832] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:23:55,363 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:23:55,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 5 [2021-11-06 00:23:55,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601041037] [2021-11-06 00:23:55,364 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:23:55,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 00:23:55,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:55,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 00:23:55,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:55,365 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:23:55,461 INFO L93 Difference]: Finished difference Result 611 states and 731 transitions. [2021-11-06 00:23:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 00:23:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 148 [2021-11-06 00:23:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:23:55,464 INFO L225 Difference]: With dead ends: 611 [2021-11-06 00:23:55,464 INFO L226 Difference]: Without dead ends: 413 [2021-11-06 00:23:55,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.77ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:23:55,465 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 3 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.91ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.01ms IncrementalHoareTripleChecker+Time [2021-11-06 00:23:55,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 746 Invalid, 88 Unknown, 0 Unchecked, 0.91ms Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 84.01ms Time] [2021-11-06 00:23:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-06 00:23:55,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2021-11-06 00:23:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 408 states have (on average 1.1642156862745099) internal successors, (475), 409 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 475 transitions. [2021-11-06 00:23:55,478 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 475 transitions. Word has length 148 [2021-11-06 00:23:55,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:23:55,478 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 475 transitions. [2021-11-06 00:23:55,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:23:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 475 transitions. [2021-11-06 00:23:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-06 00:23:55,480 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:23:55,480 INFO L514 BasicCegarLoop]: trace histogram [30, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:23:55,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-06 00:23:55,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:23:55,691 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:23:55,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:23:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1997207916, now seen corresponding path program 1 times [2021-11-06 00:23:55,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:23:55,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337021286] [2021-11-06 00:23:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:23:55,692 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:23:55,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:23:55,693 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:23:55,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-06 00:23:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:23:55,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-06 00:23:55,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:23:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 00:23:57,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:23:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 2 proven. 465 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-11-06 00:23:59,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:23:59,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337021286] [2021-11-06 00:23:59,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337021286] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:23:59,871 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:23:59,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2021-11-06 00:23:59,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571207605] [2021-11-06 00:23:59,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:23:59,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-06 00:23:59,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:23:59,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-06 00:23:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=3099, Unknown=0, NotChecked=0, Total=4032 [2021-11-06 00:23:59,875 INFO L87 Difference]: Start difference. First operand 410 states and 475 transitions. Second operand has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:25:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:25:09,255 INFO L93 Difference]: Finished difference Result 805 states and 961 transitions. [2021-11-06 00:25:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-06 00:25:09,257 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 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 148 [2021-11-06 00:25:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:25:09,259 INFO L225 Difference]: With dead ends: 805 [2021-11-06 00:25:09,259 INFO L226 Difference]: Without dead ends: 440 [2021-11-06 00:25:09,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 28075.64ms TimeCoverageRelationStatistics Valid=2700, Invalid=6042, Unknown=0, NotChecked=0, Total=8742 [2021-11-06 00:25:09,262 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 7035 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43650.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7243 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.52ms SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44350.83ms IncrementalHoareTripleChecker+Time [2021-11-06 00:25:09,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7243 Invalid, 1673 Unknown, 0 Unchecked, 14.52ms Time], IncrementalHoareTripleChecker [555 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 44350.83ms Time] [2021-11-06 00:25:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-06 00:25:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-11-06 00:25:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 438 states have (on average 1.1529680365296804) internal successors, (505), 439 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:25:09,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2021-11-06 00:25:09,290 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 148 [2021-11-06 00:25:09,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:25:09,291 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2021-11-06 00:25:09,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.59375) internal successors, (166), 64 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:25:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2021-11-06 00:25:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-06 00:25:09,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:25:09,293 INFO L514 BasicCegarLoop]: trace histogram [44, 31, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:25:09,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-06 00:25:09,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:25:09,512 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:25:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:25:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843980, now seen corresponding path program 2 times [2021-11-06 00:25:09,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:25:09,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503544249] [2021-11-06 00:25:09,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:25:09,514 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:25:09,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:25:09,515 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:25:09,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-06 00:25:10,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:25:10,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:25:10,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-06 00:25:10,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:25:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:25:11,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:25:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 2 proven. 496 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:25:15,576 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:25:15,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503544249] [2021-11-06 00:25:15,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503544249] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:25:15,577 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:25:15,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-06 00:25:15,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675106667] [2021-11-06 00:25:15,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:25:15,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-06 00:25:15,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:25:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-06 00:25:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2021-11-06 00:25:15,580 INFO L87 Difference]: Start difference. First operand 440 states and 505 transitions. Second operand has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:36,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:26:36,297 INFO L93 Difference]: Finished difference Result 868 states and 1027 transitions. [2021-11-06 00:26:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-06 00:26:36,299 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 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 178 [2021-11-06 00:26:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:26:36,301 INFO L225 Difference]: With dead ends: 868 [2021-11-06 00:26:36,301 INFO L226 Difference]: Without dead ends: 473 [2021-11-06 00:26:36,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 34317.09ms TimeCoverageRelationStatistics Valid=3199, Invalid=6113, Unknown=0, NotChecked=0, Total=9312 [2021-11-06 00:26:36,304 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 7035 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49547.19ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7243 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.05ms SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50614.30ms IncrementalHoareTripleChecker+Time [2021-11-06 00:26:36,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7243 Invalid, 1922 Unknown, 0 Unchecked, 17.05ms Time], IncrementalHoareTripleChecker [591 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 50614.30ms Time] [2021-11-06 00:26:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-11-06 00:26:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-11-06 00:26:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 471 states have (on average 1.1422505307855626) internal successors, (538), 472 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 538 transitions. [2021-11-06 00:26:36,328 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 538 transitions. Word has length 178 [2021-11-06 00:26:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:26:36,328 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 538 transitions. [2021-11-06 00:26:36,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.5454545454545454) internal successors, (168), 66 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 538 transitions. [2021-11-06 00:26:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-06 00:26:36,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:26:36,331 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:26:36,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-06 00:26:36,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:26:36,547 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:26:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:26:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1145284768, now seen corresponding path program 3 times [2021-11-06 00:26:36,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:26:36,549 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588297470] [2021-11-06 00:26:36,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-06 00:26:36,549 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:26:36,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:26:36,551 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:26:36,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 00:26:36,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-06 00:26:36,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:26:36,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 00:26:36,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:26:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 00:26:37,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:26:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3070 trivial. 0 not checked. [2021-11-06 00:26:37,912 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:26:37,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588297470] [2021-11-06 00:26:37,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588297470] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 00:26:37,912 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 00:26:37,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 00:26:37,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782634436] [2021-11-06 00:26:37,912 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-06 00:26:37,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 00:26:37,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:26:37,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 00:26:37,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 00:26:37,913 INFO L87 Difference]: Start difference. First operand 473 states and 538 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:39,183 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-06 00:26:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:26:40,966 INFO L93 Difference]: Finished difference Result 983 states and 1122 transitions. [2021-11-06 00:26:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 00:26:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 211 [2021-11-06 00:26:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:26:40,969 INFO L225 Difference]: With dead ends: 983 [2021-11-06 00:26:40,970 INFO L226 Difference]: Without dead ends: 555 [2021-11-06 00:26:40,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.99ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 00:26:40,971 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 395 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2876.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.32ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3016.48ms IncrementalHoareTripleChecker+Time [2021-11-06 00:26:40,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 335 Invalid, 83 Unknown, 0 Unchecked, 1.32ms Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 3016.48ms Time] [2021-11-06 00:26:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-06 00:26:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 548. [2021-11-06 00:26:40,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 546 states have (on average 1.1446886446886446) internal successors, (625), 547 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 625 transitions. [2021-11-06 00:26:40,999 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 625 transitions. Word has length 211 [2021-11-06 00:26:41,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:26:41,000 INFO L470 AbstractCegarLoop]: Abstraction has 548 states and 625 transitions. [2021-11-06 00:26:41,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:26:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 625 transitions. [2021-11-06 00:26:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-06 00:26:41,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:26:41,002 INFO L514 BasicCegarLoop]: trace histogram [64, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:26:41,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-06 00:26:41,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:26:41,217 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:26:41,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:26:41,218 INFO L85 PathProgramCache]: Analyzing trace with hash 670931834, now seen corresponding path program 1 times [2021-11-06 00:26:41,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:26:41,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641980887] [2021-11-06 00:26:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 00:26:41,219 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:26:41,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:26:41,221 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:26:41,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 00:26:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 00:26:42,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-06 00:26:42,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:26:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:26:45,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:27:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 2 proven. 2080 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:27:00,842 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:27:00,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641980887] [2021-11-06 00:27:00,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641980887] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:27:00,842 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:27:00,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2021-11-06 00:27:00,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756511352] [2021-11-06 00:27:00,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:27:00,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-06 00:27:00,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:27:00,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-06 00:27:00,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4486, Invalid=12806, Unknown=0, NotChecked=0, Total=17292 [2021-11-06 00:27:00,849 INFO L87 Difference]: Start difference. First operand 548 states and 625 transitions. Second operand has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:31:13,708 WARN L230 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 196 [2021-11-06 00:31:22,612 WARN L230 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 193 [2021-11-06 00:31:31,540 WARN L230 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 190 [2021-11-06 00:31:40,764 WARN L230 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 187 [2021-11-06 00:31:49,613 WARN L230 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 184 [2021-11-06 00:31:51,716 WARN L860 $PredicateComparison]: unable to prove that (and (bvult (bvadd (_ bv29 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv50 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv53 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv14 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv1 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv24 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv6 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv39 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv26 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv54 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv55 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv20 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv36 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv2 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv59 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv48 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv38 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv46 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv18 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv7 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv45 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv28 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv23 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv33 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv58 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv32 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv41 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv8 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv19 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv4 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv35 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv34 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv42 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv47 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv37 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv57 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv44 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv52 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv13 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv16 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv56 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv30 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv12 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv10 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv21 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv3 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv43 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv51 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv9 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv15 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv5 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv11 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv25 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv27 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv49 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv22 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278| (_ bv40 32)) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv31 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|) (bvult (bvadd (_ bv17 32) |c_ULTIMATE.start_#Ultimate.C_memset_#t~loopctr278|) |c_ULTIMATE.start_#Ultimate.C_memset_#amount|)) is different from true [2021-11-06 00:31:59,741 WARN L230 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 178 [2021-11-06 00:32:23,228 WARN L230 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 169 [2021-11-06 00:33:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 00:33:37,897 INFO L93 Difference]: Finished difference Result 1003 states and 1217 transitions. [2021-11-06 00:33:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-06 00:33:37,899 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 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) Word has length 218 [2021-11-06 00:33:37,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 00:33:37,902 INFO L225 Difference]: With dead ends: 1003 [2021-11-06 00:33:37,902 INFO L226 Difference]: Without dead ends: 614 [2021-11-06 00:33:37,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 273402.68ms TimeCoverageRelationStatistics Valid=12746, Invalid=25087, Unknown=1, NotChecked=386, Total=38220 [2021-11-06 00:33:37,909 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 13869 mSDsCounter, 0 mSdLazyCounter, 4795 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 136957.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14077 SdHoareTripleChecker+Invalid, 5915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 43.68ms SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 4795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 140424.52ms IncrementalHoareTripleChecker+Time [2021-11-06 00:33:37,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14077 Invalid, 5915 Unknown, 0 Unchecked, 43.68ms Time], IncrementalHoareTripleChecker [1119 Valid, 4795 Invalid, 0 Unknown, 1 Unchecked, 140424.52ms Time] [2021-11-06 00:33:37,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-11-06 00:33:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-11-06 00:33:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 612 states have (on average 1.1290849673202614) internal successors, (691), 613 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:33:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2021-11-06 00:33:37,952 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 218 [2021-11-06 00:33:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 00:33:37,953 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2021-11-06 00:33:37,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 1.8257575757575757) internal successors, (241), 132 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 00:33:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2021-11-06 00:33:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-11-06 00:33:37,956 INFO L506 BasicCegarLoop]: Found error trace [2021-11-06 00:33:37,956 INFO L514 BasicCegarLoop]: trace histogram [130, 44, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 00:33:37,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-06 00:33:38,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 00:33:38,176 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-06 00:33:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 00:33:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash 249759226, now seen corresponding path program 2 times [2021-11-06 00:33:38,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 00:33:38,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400680980] [2021-11-06 00:33:38,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-06 00:33:38,177 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 00:33:38,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 00:33:38,178 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 00:33:38,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-06 00:33:39,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-06 00:33:39,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-06 00:33:39,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-06 00:33:39,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 00:33:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:33:50,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 00:34:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9507 backedges. 2 proven. 8515 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2021-11-06 00:34:50,039 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 00:34:50,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400680980] [2021-11-06 00:34:50,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400680980] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 00:34:50,039 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 00:34:50,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 264 [2021-11-06 00:34:50,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778599709] [2021-11-06 00:34:50,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-06 00:34:50,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 264 states [2021-11-06 00:34:50,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 00:34:50,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2021-11-06 00:34:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17686, Invalid=51746, Unknown=0, NotChecked=0, Total=69432 [2021-11-06 00:34:50,051 INFO L87 Difference]: Start difference. First operand 614 states and 691 transitions. Second operand has 264 states, 264 states have (on average 1.4128787878787878) internal successors, (373), 264 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) Killed by 15