./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5b36d44f 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_SAX_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 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 22:43:49,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 22:43:49,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 22:43:49,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 22:43:49,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 22:43:49,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 22:43:49,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 22:43:49,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 22:43:49,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 22:43:49,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 22:43:49,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 22:43:49,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 22:43:49,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 22:43:49,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 22:43:49,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 22:43:49,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 22:43:49,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 22:43:49,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 22:43:49,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 22:43:49,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 22:43:49,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 22:43:49,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 22:43:49,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 22:43:49,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 22:43:49,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 22:43:49,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 22:43:49,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 22:43:49,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 22:43:49,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 22:43:49,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 22:43:49,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 22:43:49,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 22:43:49,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 22:43:49,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 22:43:49,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 22:43:49,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 22:43:49,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 22:43:49,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 22:43:49,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 22:43:49,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 22:43:49,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 22:43:49,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 22:43:49,802 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 22:43:49,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 22:43:49,802 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 22:43:49,803 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 22:43:49,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 22:43:49,804 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 22:43:49,804 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 22:43:49,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 22:43:49,804 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 22:43:49,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 22:43:49,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 22:43:49,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 22:43:49,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 22:43:49,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 22:43:49,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 22:43:49,806 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 22:43:49,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 22:43:49,806 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 22:43:49,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 22:43:49,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 22:43:49,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 22:43:49,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 22:43:49,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 22:43:49,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 22:43:49,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 22:43:49,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 22:43:49,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 22:43:49,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 22:43:49,808 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 22:43:49,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 22:43:49,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 22:43:49,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 22:43:49,809 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 -> 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f [2021-11-07 22:43:49,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 22:43:50,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 22:43:50,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 22:43:50,017 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 22:43:50,017 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 22:43:50,018 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2021-11-07 22:43:50,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94e0dad7/fd6dc2a36799463aaed27295ca8e27c6/FLAG010a3b435 [2021-11-07 22:43:50,433 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 22:43:50,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2021-11-07 22:43:50,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94e0dad7/fd6dc2a36799463aaed27295ca8e27c6/FLAG010a3b435 [2021-11-07 22:43:50,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94e0dad7/fd6dc2a36799463aaed27295ca8e27c6 [2021-11-07 22:43:50,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 22:43:50,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 22:43:50,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 22:43:50,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 22:43:50,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 22:43:50,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:43:50" (1/1) ... [2021-11-07 22:43:50,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@607349ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:50, skipping insertion in model container [2021-11-07 22:43:50,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:43:50" (1/1) ... [2021-11-07 22:43:50,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 22:43:50,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 22:43:51,113 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_SAX_test7-2.i[33021,33034] [2021-11-07 22:43:51,202 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_SAX_test7-2.i[44124,44137] [2021-11-07 22:43:51,206 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_SAX_test7-2.i[44245,44258] [2021-11-07 22:43:51,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 22:43:51,238 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 22:43:51,264 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_SAX_test7-2.i[33021,33034] [2021-11-07 22:43:51,293 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_SAX_test7-2.i[44124,44137] [2021-11-07 22:43:51,294 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_SAX_test7-2.i[44245,44258] [2021-11-07 22:43:51,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 22:43:51,323 INFO L208 MainTranslator]: Completed translation [2021-11-07 22:43:51,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51 WrapperNode [2021-11-07 22:43:51,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 22:43:51,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 22:43:51,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 22:43:51,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 22:43:51,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 22:43:51,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 22:43:51,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 22:43:51,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 22:43:51,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 22:43:51,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 22:43:51,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 22:43:51,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 22:43:51,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (1/1) ... [2021-11-07 22:43:51,515 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 22:43:51,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:51,536 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-07 22:43:51,555 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-07 22:43:51,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 22:43:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 22:43:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 22:43:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 22:43:51,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 22:43:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-07 22:43:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 22:43:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 22:43:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 22:43:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 22:43:51,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 22:43:52,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 22:43:52,528 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-11-07 22:43:52,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:43:52 BoogieIcfgContainer [2021-11-07 22:43:52,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 22:43:52,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 22:43:52,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 22:43:52,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 22:43:52,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:43:50" (1/3) ... [2021-11-07 22:43:52,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fd8c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:43:52, skipping insertion in model container [2021-11-07 22:43:52,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:43:51" (2/3) ... [2021-11-07 22:43:52,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fd8c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:43:52, skipping insertion in model container [2021-11-07 22:43:52,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:43:52" (3/3) ... [2021-11-07 22:43:52,537 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test7-2.i [2021-11-07 22:43:52,540 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 22:43:52,540 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 22:43:52,577 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 22:43:52,583 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-07 22:43:52,583 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 22:43:52,606 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-07 22:43:52,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 22:43:52,610 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:52,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 22:43:52,611 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-07 22:43:52,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:52,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348962337] [2021-11-07 22:43:52,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:52,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:52,741 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-07 22:43:52,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:52,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348962337] [2021-11-07 22:43:52,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348962337] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:52,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:52,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 22:43:52,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789994277] [2021-11-07 22:43:52,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:52,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 22:43:52,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:52,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 22:43:52,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 22:43:52,812 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-07 22:43:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:52,857 INFO L93 Difference]: Finished difference Result 419 states and 707 transitions. [2021-11-07 22:43:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 22:43:52,859 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-07 22:43:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:52,867 INFO L225 Difference]: With dead ends: 419 [2021-11-07 22:43:52,868 INFO L226 Difference]: Without dead ends: 177 [2021-11-07 22:43:52,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.02ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 22:43:52,874 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, 3.88ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:52,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 3.88ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 22:43:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-07 22:43:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-07 22:43:52,923 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-07 22:43:52,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-07 22:43:52,925 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-07 22:43:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:52,925 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-07 22:43:52,926 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-07 22:43:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-07 22:43:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 22:43:52,926 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:52,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 22:43:52,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 22:43:52,927 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-07 22:43:52,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:52,929 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118416106] [2021-11-07 22:43:52,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:52,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:52,985 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-07 22:43:52,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:52,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118416106] [2021-11-07 22:43:52,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118416106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:52,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:52,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 22:43:52,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662968493] [2021-11-07 22:43:52,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:52,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 22:43:52,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 22:43:52,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 22:43:52,988 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-07 22:43:53,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:53,231 INFO L93 Difference]: Finished difference Result 382 states and 501 transitions. [2021-11-07 22:43:53,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:43:53,232 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-07 22:43:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:53,233 INFO L225 Difference]: With dead ends: 382 [2021-11-07 22:43:53,233 INFO L226 Difference]: Without dead ends: 295 [2021-11-07 22:43:53,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.48ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:43:53,234 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 146 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 173.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.61ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 215.28ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:53,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 564 Invalid, 158 Unknown, 0 Unchecked, 3.61ms Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 215.28ms Time] [2021-11-07 22:43:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-11-07 22:43:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 179. [2021-11-07 22:43:53,246 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-07 22:43:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-07 22:43:53,246 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-07 22:43:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:53,247 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-07 22:43:53,249 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-07 22:43:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-07 22:43:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 22:43:53,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:53,251 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-07 22:43:53,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 22:43:53,251 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:53,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-07 22:43:53,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:53,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200934005] [2021-11-07 22:43:53,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:53,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:53,279 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 22:43:53,283 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541028760] [2021-11-07 22:43:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:53,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 22:43:53,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:53,285 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-07 22:43:53,286 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-07 22:43:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:53,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:43:53,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:43:53,585 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-07 22:43:53,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 22:43:53,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:53,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200934005] [2021-11-07 22:43:53,586 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 22:43:53,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541028760] [2021-11-07 22:43:53,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541028760] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:53,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:53,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 22:43:53,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943963207] [2021-11-07 22:43:53,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:53,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 22:43:53,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:53,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 22:43:53,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 22:43:53,591 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-07 22:43:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:53,634 INFO L93 Difference]: Finished difference Result 375 states and 495 transitions. [2021-11-07 22:43:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 22:43:53,635 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-07 22:43:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:53,637 INFO L225 Difference]: With dead ends: 375 [2021-11-07 22:43:53,637 INFO L226 Difference]: Without dead ends: 200 [2021-11-07 22:43:53,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.34ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 22:43:53,642 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.71ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.69ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:53,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 409 Invalid, 72 Unknown, 0 Unchecked, 0.71ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 34.69ms Time] [2021-11-07 22:43:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-07 22:43:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2021-11-07 22:43:53,667 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-07 22:43:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 254 transitions. [2021-11-07 22:43:53,668 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 254 transitions. Word has length 62 [2021-11-07 22:43:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:53,668 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 254 transitions. [2021-11-07 22:43:53,668 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-07 22:43:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 254 transitions. [2021-11-07 22:43:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 22:43:53,669 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:53,669 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-07 22:43:53,689 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-07 22:43:53,887 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-07 22:43:53,887 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:53,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1305568807, now seen corresponding path program 1 times [2021-11-07 22:43:53,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:53,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593919423] [2021-11-07 22:43:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:53,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:53,898 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 22:43:53,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440365709] [2021-11-07 22:43:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:53,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 22:43:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:53,903 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-07 22:43:53,906 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-07 22:43:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:54,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:43:54,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:43:54,125 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-07 22:43:54,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 22:43:54,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:54,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593919423] [2021-11-07 22:43:54,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 22:43:54,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440365709] [2021-11-07 22:43:54,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440365709] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:54,130 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:54,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 22:43:54,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964660422] [2021-11-07 22:43:54,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:54,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 22:43:54,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:54,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 22:43:54,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 22:43:54,131 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-07 22:43:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:54,179 INFO L93 Difference]: Finished difference Result 386 states and 496 transitions. [2021-11-07 22:43:54,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:43:54,179 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-07 22:43:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:54,180 INFO L225 Difference]: With dead ends: 386 [2021-11-07 22:43:54,180 INFO L226 Difference]: Without dead ends: 191 [2021-11-07 22:43:54,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.84ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:43:54,181 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 220 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.16ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.27ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:54,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 420 Invalid, 66 Unknown, 0 Unchecked, 1.16ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 38.27ms Time] [2021-11-07 22:43:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-07 22:43:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185. [2021-11-07 22:43:54,187 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-07 22:43:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 233 transitions. [2021-11-07 22:43:54,188 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 233 transitions. Word has length 62 [2021-11-07 22:43:54,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:54,188 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 233 transitions. [2021-11-07 22:43:54,188 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-07 22:43:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 233 transitions. [2021-11-07 22:43:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 22:43:54,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:54,191 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-07 22:43:54,210 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-07 22:43:54,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-07 22:43:54,407 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:54,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-07 22:43:54,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:54,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205686817] [2021-11-07 22:43:54,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:54,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:54,421 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 22:43:54,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722358711] [2021-11-07 22:43:54,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:54,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 22:43:54,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:54,422 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-07 22:43:54,423 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-07 22:43:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:54,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 22:43:54,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:43:54,818 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-07 22:43:54,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 22:43:54,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:54,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205686817] [2021-11-07 22:43:54,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 22:43:54,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722358711] [2021-11-07 22:43:54,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722358711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:54,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:54,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 22:43:54,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097362803] [2021-11-07 22:43:54,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:54,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 22:43:54,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 22:43:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 22:43:54,820 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-07 22:43:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:54,879 INFO L93 Difference]: Finished difference Result 479 states and 602 transitions. [2021-11-07 22:43:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 22:43:54,880 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-07 22:43:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:54,881 INFO L225 Difference]: With dead ends: 479 [2021-11-07 22:43:54,881 INFO L226 Difference]: Without dead ends: 298 [2021-11-07 22:43:54,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.58ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 22:43:54,882 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 105 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.07ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:54,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 463 Invalid, 32 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 53.07ms Time] [2021-11-07 22:43:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-11-07 22:43:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2021-11-07 22:43:54,887 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-07 22:43:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 366 transitions. [2021-11-07 22:43:54,887 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 366 transitions. Word has length 62 [2021-11-07 22:43:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:54,888 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 366 transitions. [2021-11-07 22:43:54,888 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-07 22:43:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 366 transitions. [2021-11-07 22:43:54,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 22:43:54,888 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:54,888 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-07 22:43:54,912 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-07 22:43:55,089 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-07 22:43:55,089 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:55,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-07 22:43:55,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:55,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023552857] [2021-11-07 22:43:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:55,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:55,105 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 22:43:55,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113638592] [2021-11-07 22:43:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:55,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 22:43:55,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:55,106 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-07 22:43:55,108 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-07 22:43:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:55,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:43:55,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:43:55,347 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-07 22:43:55,357 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-07 22:43:55,372 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-07 22:43:55,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 22:43:55,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:55,372 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023552857] [2021-11-07 22:43:55,372 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 22:43:55,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113638592] [2021-11-07 22:43:55,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113638592] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:55,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:55,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 22:43:55,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361323580] [2021-11-07 22:43:55,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:55,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 22:43:55,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:55,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 22:43:55,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 22:43:55,374 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-07 22:43:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:55,612 INFO L93 Difference]: Finished difference Result 379 states and 483 transitions. [2021-11-07 22:43:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:43:55,612 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-07 22:43:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:55,614 INFO L225 Difference]: With dead ends: 379 [2021-11-07 22:43:55,614 INFO L226 Difference]: Without dead ends: 375 [2021-11-07 22:43:55,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.20ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:43:55,614 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 135 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 194.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.47ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 224.48ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:55,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 564 Invalid, 137 Unknown, 0 Unchecked, 1.47ms Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 224.48ms Time] [2021-11-07 22:43:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2021-11-07 22:43:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 293. [2021-11-07 22:43:55,620 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-07 22:43:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 368 transitions. [2021-11-07 22:43:55,621 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 368 transitions. Word has length 69 [2021-11-07 22:43:55,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:55,621 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 368 transitions. [2021-11-07 22:43:55,621 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-07 22:43:55,621 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 368 transitions. [2021-11-07 22:43:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-07 22:43:55,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:55,622 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-07 22:43:55,640 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-07 22:43:55,827 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-07 22:43:55,827 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2000986198, now seen corresponding path program 1 times [2021-11-07 22:43:55,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:55,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040443071] [2021-11-07 22:43:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:55,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:55,838 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 22:43:55,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458958958] [2021-11-07 22:43:55,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:55,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 22:43:55,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:55,840 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-07 22:43:55,841 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-07 22:43:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:55,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:43:55,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:43:56,120 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-07 22:43:56,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 22:43:56,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:56,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040443071] [2021-11-07 22:43:56,121 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 22:43:56,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458958958] [2021-11-07 22:43:56,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458958958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:56,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:56,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 22:43:56,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466144991] [2021-11-07 22:43:56,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:56,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 22:43:56,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:56,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 22:43:56,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 22:43:56,123 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-07 22:43:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:56,167 INFO L93 Difference]: Finished difference Result 483 states and 627 transitions. [2021-11-07 22:43:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 22:43:56,168 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-07 22:43:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:56,169 INFO L225 Difference]: With dead ends: 483 [2021-11-07 22:43:56,169 INFO L226 Difference]: Without dead ends: 335 [2021-11-07 22:43:56,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.68ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 22:43:56,170 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.20ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:56,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 395 Invalid, 72 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 34.20ms Time] [2021-11-07 22:43:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-11-07 22:43:56,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2021-11-07 22:43:56,175 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-07 22:43:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 408 transitions. [2021-11-07 22:43:56,176 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 408 transitions. Word has length 103 [2021-11-07 22:43:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:56,176 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 408 transitions. [2021-11-07 22:43:56,176 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-07 22:43:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 408 transitions. [2021-11-07 22:43:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-07 22:43:56,177 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:56,177 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-07 22:43:56,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-07 22:43:56,391 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-07 22:43:56,391 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1973776046, now seen corresponding path program 1 times [2021-11-07 22:43:56,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:56,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970714824] [2021-11-07 22:43:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:56,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:56,407 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 22:43:56,407 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847491575] [2021-11-07 22:43:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:56,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 22:43:56,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:56,408 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-07 22:43:56,409 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-07 22:43:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:56,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:43:56,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:43:56,668 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-07 22:43:56,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 22:43:56,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:56,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970714824] [2021-11-07 22:43:56,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 22:43:56,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847491575] [2021-11-07 22:43:56,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847491575] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:56,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:56,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 22:43:56,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522994211] [2021-11-07 22:43:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:56,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 22:43:56,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:56,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 22:43:56,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 22:43:56,670 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-07 22:43:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:56,713 INFO L93 Difference]: Finished difference Result 498 states and 622 transitions. [2021-11-07 22:43:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:43:56,714 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-07 22:43:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:56,715 INFO L225 Difference]: With dead ends: 498 [2021-11-07 22:43:56,715 INFO L226 Difference]: Without dead ends: 310 [2021-11-07 22:43:56,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.72ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:43:56,716 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 103 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.87ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.78ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:56,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 510 Invalid, 66 Unknown, 0 Unchecked, 0.87ms Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 33.78ms Time] [2021-11-07 22:43:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-11-07 22:43:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 305. [2021-11-07 22:43:56,721 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-07 22:43:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2021-11-07 22:43:56,722 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 103 [2021-11-07 22:43:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:56,722 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2021-11-07 22:43:56,722 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-07 22:43:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2021-11-07 22:43:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-07 22:43:56,723 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:56,723 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-07 22:43:56,740 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-07 22:43:56,936 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-07 22:43:56,936 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1090927200, now seen corresponding path program 1 times [2021-11-07 22:43:56,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:56,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897738217] [2021-11-07 22:43:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:56,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:56,946 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 22:43:56,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1996403887] [2021-11-07 22:43:56,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:56,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 22:43:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:56,947 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-07 22:43:56,948 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-07 22:43:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:57,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 22:43:57,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:43:57,235 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-07 22:43:57,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-07 22:43:57,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:43:57,235 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897738217] [2021-11-07 22:43:57,235 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 22:43:57,236 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996403887] [2021-11-07 22:43:57,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996403887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 22:43:57,236 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:43:57,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 22:43:57,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365322215] [2021-11-07 22:43:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 22:43:57,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 22:43:57,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 22:43:57,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 22:43:57,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 22:43:57,237 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-07 22:43:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:43:57,363 INFO L93 Difference]: Finished difference Result 653 states and 790 transitions. [2021-11-07 22:43:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:43:57,363 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-07 22:43:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:43:57,365 INFO L225 Difference]: With dead ends: 653 [2021-11-07 22:43:57,365 INFO L226 Difference]: Without dead ends: 396 [2021-11-07 22:43:57,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.77ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:43:57,365 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 416 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 93.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.15ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 112.10ms IncrementalHoareTripleChecker+Time [2021-11-07 22:43:57,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 365 Invalid, 77 Unknown, 0 Unchecked, 1.15ms Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 112.10ms Time] [2021-11-07 22:43:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-11-07 22:43:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2021-11-07 22:43:57,380 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-07 22:43:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 470 transitions. [2021-11-07 22:43:57,381 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 470 transitions. Word has length 103 [2021-11-07 22:43:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:43:57,382 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 470 transitions. [2021-11-07 22:43:57,382 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-07 22:43:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 470 transitions. [2021-11-07 22:43:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-07 22:43:57,382 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:43:57,383 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-07 22:43:57,405 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-07 22:43:57,591 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-07 22:43:57,591 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:43:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:43:57,592 INFO L85 PathProgramCache]: Analyzing trace with hash 541561274, now seen corresponding path program 1 times [2021-11-07 22:43:57,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 22:43:57,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600313154] [2021-11-07 22:43:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:57,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 22:43:57,601 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-07 22:43:57,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291106148] [2021-11-07 22:43:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:43:57,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 22:43:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:43:57,602 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-07 22:43:57,604 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-07 22:43:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:43:57,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 54 conjunts are in the unsatisfiable core [2021-11-07 22:43:57,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:43:57,729 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-07 22:43:57,732 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-07 22:43:57,764 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-07 22:43:57,765 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-07 22:43:57,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:57,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:57,814 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-07 22:43:58,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,509 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-07 22:43:58,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,515 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-07 22:43:58,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,588 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-07 22:43:58,630 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-07 22:43:58,647 INFO L354 Elim1Store]: treesize reduction 70, result has 23.1 percent of original size [2021-11-07 22:43:58,647 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-07 22:43:58,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:58,664 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-07 22:43:58,676 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-07 22:43:59,898 INFO L354 Elim1Store]: treesize reduction 364, result has 11.9 percent of original size [2021-11-07 22:43:59,899 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-07 22:43:59,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:59,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:43:59,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 22:44:04,278 INFO L354 Elim1Store]: treesize reduction 7776, result has 3.0 percent of original size [2021-11-07 22:44:04,278 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-07 22:44:04,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 22:44:04,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600313154] [2021-11-07 22:44:04,327 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 22:44:04,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291106148] [2021-11-07 22:44:04,327 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-07 22:44:04,327 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:04,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-07 22:44:04,327 ERROR L172 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2021-11-07 22:44:04,327 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-07 22:44:04,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-07 22:44:04,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-07 22:44:04,353 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-07 22:44:04,549 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-07 22:44:04,552 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 22:44:04,554 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 22:44:04,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:44:04 BoogieIcfgContainer [2021-11-07 22:44:04,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 22:44:04,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 22:44:04,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 22:44:04,583 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 22:44:04,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:43:52" (3/4) ... [2021-11-07 22:44:04,585 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 22:44:04,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 22:44:04,586 INFO L158 Benchmark]: Toolchain (without parser) took 13808.00ms. Allocated memory was 86.0MB in the beginning and 161.5MB in the end (delta: 75.5MB). Free memory was 54.1MB in the beginning and 120.7MB in the end (delta: -66.6MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2021-11-07 22:44:04,586 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 86.0MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 22:44:04,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.71ms. Allocated memory is still 86.0MB. Free memory was 53.8MB in the beginning and 41.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-07 22:44:04,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.15ms. Allocated memory is still 86.0MB. Free memory was 41.0MB in the beginning and 34.0MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-07 22:44:04,587 INFO L158 Benchmark]: Boogie Preprocessor took 95.54ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 34.0MB in the beginning and 80.4MB in the end (delta: -46.4MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2021-11-07 22:44:04,587 INFO L158 Benchmark]: RCFGBuilder took 1030.42ms. Allocated memory is still 111.1MB. Free memory was 79.7MB in the beginning and 56.5MB in the end (delta: 23.1MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2021-11-07 22:44:04,587 INFO L158 Benchmark]: TraceAbstraction took 12051.92ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 55.9MB in the beginning and 120.7MB in the end (delta: -64.9MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. [2021-11-07 22:44:04,587 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 161.5MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 22:44:04,588 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.11ms. Allocated memory is still 86.0MB. Free memory was 42.7MB in the beginning and 42.7MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.71ms. Allocated memory is still 86.0MB. Free memory was 53.8MB in the beginning and 41.4MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.15ms. Allocated memory is still 86.0MB. Free memory was 41.0MB in the beginning and 34.0MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.54ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 34.0MB in the beginning and 80.4MB in the end (delta: -46.4MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1030.42ms. Allocated memory is still 111.1MB. Free memory was 79.7MB in the beginning and 56.5MB in the end (delta: 23.1MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12051.92ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 55.9MB in the beginning and 120.7MB in the end (delta: -64.9MB). Peak memory consumption was 70.7MB. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 161.5MB. Free memory is still 120.7MB. 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: 11977.06ms, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 19.79ms, AutomataDifference: 1018.82ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 15.40ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1143 SdHoareTripleChecker+Valid, 745.88ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1143 mSDsluCounter, 3966 SdHoareTripleChecker+Invalid, 621.71ms 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, 14.32ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.62ms 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: 106.36ms AutomataMinimizationTime, 9 MinimizatonAttempts, 226 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 374.80ms SsaConstructionTime, 322.93ms SatisfiabilityAnalysisTime, 7753.98ms 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-07 22:44:04,631 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_SAX_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 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 22:44:06,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 22:44:06,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 22:44:06,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 22:44:06,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 22:44:06,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 22:44:06,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 22:44:06,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 22:44:06,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 22:44:06,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 22:44:06,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 22:44:06,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 22:44:06,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 22:44:06,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 22:44:06,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 22:44:06,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 22:44:06,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 22:44:06,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 22:44:06,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 22:44:06,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 22:44:06,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 22:44:06,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 22:44:06,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 22:44:06,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 22:44:06,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 22:44:06,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 22:44:06,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 22:44:06,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 22:44:06,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 22:44:06,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 22:44:06,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 22:44:06,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 22:44:06,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 22:44:06,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 22:44:06,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 22:44:06,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 22:44:06,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 22:44:06,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 22:44:06,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 22:44:06,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 22:44:06,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 22:44:06,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-07 22:44:06,316 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 22:44:06,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 22:44:06,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 22:44:06,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 22:44:06,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 22:44:06,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 22:44:06,319 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 22:44:06,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 22:44:06,319 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 22:44:06,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 22:44:06,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 22:44:06,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 22:44:06,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 22:44:06,320 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 22:44:06,320 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 22:44:06,320 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 22:44:06,321 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 22:44:06,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 22:44:06,321 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 22:44:06,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 22:44:06,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 22:44:06,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 22:44:06,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 22:44:06,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 22:44:06,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 22:44:06,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 22:44:06,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 22:44:06,322 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-07 22:44:06,322 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 22:44:06,322 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 22:44:06,322 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 22:44:06,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 22:44:06,323 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 22:44:06,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 22:44:06,323 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 -> 32a24617e0b83f023304780397185eef703cdbd26842fbad821fea93a0f1f12f [2021-11-07 22:44:06,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 22:44:06,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 22:44:06,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 22:44:06,563 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 22:44:06,564 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 22:44:06,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2021-11-07 22:44:06,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9da067c8/8d5af3de1c43468b9778f39ca627d40f/FLAG6324b5776 [2021-11-07 22:44:07,060 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 22:44:07,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test7-2.i [2021-11-07 22:44:07,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9da067c8/8d5af3de1c43468b9778f39ca627d40f/FLAG6324b5776 [2021-11-07 22:44:07,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9da067c8/8d5af3de1c43468b9778f39ca627d40f [2021-11-07 22:44:07,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 22:44:07,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 22:44:07,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 22:44:07,392 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 22:44:07,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 22:44:07,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:07,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297c9c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07, skipping insertion in model container [2021-11-07 22:44:07,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:07,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 22:44:07,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 22:44:07,729 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_SAX_test7-2.i[33021,33034] [2021-11-07 22:44:07,808 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_SAX_test7-2.i[44124,44137] [2021-11-07 22:44:07,809 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_SAX_test7-2.i[44245,44258] [2021-11-07 22:44:07,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 22:44:07,829 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 22:44:07,846 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_SAX_test7-2.i[33021,33034] [2021-11-07 22:44:07,897 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_SAX_test7-2.i[44124,44137] [2021-11-07 22:44:07,898 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_SAX_test7-2.i[44245,44258] [2021-11-07 22:44:07,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 22:44:07,936 INFO L208 MainTranslator]: Completed translation [2021-11-07 22:44:07,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07 WrapperNode [2021-11-07 22:44:07,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 22:44:07,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 22:44:07,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 22:44:07,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 22:44:07,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:07,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 22:44:08,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 22:44:08,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 22:44:08,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 22:44:08,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 22:44:08,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 22:44:08,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 22:44:08,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 22:44:08,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (1/1) ... [2021-11-07 22:44:08,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 22:44:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 22:44:08,109 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-07 22:44:08,121 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-07 22:44:08,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-07 22:44:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-07 22:44:08,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 22:44:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 22:44:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 22:44:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-07 22:44:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 22:44:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 22:44:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-07 22:44:08,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 22:44:08,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 22:44:08,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 22:44:11,506 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 22:44:11,509 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-11-07 22:44:11,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:11 BoogieIcfgContainer [2021-11-07 22:44:11,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 22:44:11,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 22:44:11,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 22:44:11,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 22:44:11,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:44:07" (1/3) ... [2021-11-07 22:44:11,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c8813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:11, skipping insertion in model container [2021-11-07 22:44:11,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:44:07" (2/3) ... [2021-11-07 22:44:11,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c8813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:44:11, skipping insertion in model container [2021-11-07 22:44:11,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:44:11" (3/3) ... [2021-11-07 22:44:11,517 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test7-2.i [2021-11-07 22:44:11,520 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 22:44:11,520 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 22:44:11,567 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 22:44:11,574 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-07 22:44:11,574 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 22:44:11,589 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-07 22:44:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 22:44:11,593 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:11,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 22:44:11,593 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:11,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1366407864, now seen corresponding path program 1 times [2021-11-07 22:44:11,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:11,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079127177] [2021-11-07 22:44:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:11,605 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:11,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:11,612 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-07 22:44:11,613 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-07 22:44:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:11,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-07 22:44:11,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:11,792 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-07 22:44:11,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:11,816 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-07 22:44:11,817 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:11,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079127177] [2021-11-07 22:44:11,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079127177] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:44:11,818 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:11,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 22:44:11,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950449402] [2021-11-07 22:44:11,820 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:44:11,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 22:44:11,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:11,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 22:44:11,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 22:44:11,853 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-07 22:44:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:11,877 INFO L93 Difference]: Finished difference Result 419 states and 707 transitions. [2021-11-07 22:44:11,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 22:44:11,882 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-07 22:44:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:11,890 INFO L225 Difference]: With dead ends: 419 [2021-11-07 22:44:11,891 INFO L226 Difference]: Without dead ends: 177 [2021-11-07 22:44:11,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.07ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 22:44:11,898 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, 1.59ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:11,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.59ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 22:44:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-07 22:44:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-07 22:44:11,940 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-07 22:44:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2021-11-07 22:44:11,944 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 8 [2021-11-07 22:44:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:11,945 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2021-11-07 22:44:11,945 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-07 22:44:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2021-11-07 22:44:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 22:44:11,946 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:11,946 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 22:44:11,958 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-07 22:44:12,155 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-07 22:44:12,156 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:12,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1136278917, now seen corresponding path program 1 times [2021-11-07 22:44:12,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:12,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415207563] [2021-11-07 22:44:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:12,157 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:12,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:12,159 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-07 22:44:12,161 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-07 22:44:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:12,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:44:12,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:12,290 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-07 22:44:12,324 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-07 22:44:12,344 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-07 22:44:12,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:12,379 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-07 22:44:12,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:12,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415207563] [2021-11-07 22:44:12,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415207563] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:44:12,380 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:12,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 22:44:12,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748963707] [2021-11-07 22:44:12,380 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:44:12,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 22:44:12,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 22:44:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 22:44:12,382 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-07 22:44:14,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:14,011 INFO L93 Difference]: Finished difference Result 468 states and 614 transitions. [2021-11-07 22:44:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 22:44:14,012 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-07 22:44:14,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:14,013 INFO L225 Difference]: With dead ends: 468 [2021-11-07 22:44:14,014 INFO L226 Difference]: Without dead ends: 381 [2021-11-07 22:44:14,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.18ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 22:44:14,015 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 396 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1432.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.82ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1592.11ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:14,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 652 Invalid, 206 Unknown, 0 Unchecked, 5.82ms Time], IncrementalHoareTripleChecker [8 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 1592.11ms Time] [2021-11-07 22:44:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-11-07 22:44:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 179. [2021-11-07 22:44:14,023 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-07 22:44:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2021-11-07 22:44:14,024 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 10 [2021-11-07 22:44:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:14,024 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2021-11-07 22:44:14,024 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-07 22:44:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2021-11-07 22:44:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 22:44:14,025 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:14,026 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-07 22:44:14,035 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-07 22:44:14,231 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-07 22:44:14,231 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:14,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2095912151, now seen corresponding path program 1 times [2021-11-07 22:44:14,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:14,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345752654] [2021-11-07 22:44:14,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:14,233 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:14,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:14,234 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-07 22:44:14,236 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-07 22:44:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:14,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:44:14,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:14,502 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-07 22:44:14,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:14,627 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-07 22:44:14,627 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:14,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345752654] [2021-11-07 22:44:14,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345752654] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:44:14,628 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:14,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-07 22:44:14,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984119136] [2021-11-07 22:44:14,628 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:44:14,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 22:44:14,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 22:44:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:44:14,629 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-07 22:44:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:14,710 INFO L93 Difference]: Finished difference Result 363 states and 476 transitions. [2021-11-07 22:44:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:44:14,711 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-07 22:44:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:14,712 INFO L225 Difference]: With dead ends: 363 [2021-11-07 22:44:14,712 INFO L226 Difference]: Without dead ends: 188 [2021-11-07 22:44:14,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.32ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 22:44:14,713 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 217 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.18ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.79ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:14,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 423 Invalid, 69 Unknown, 0 Unchecked, 1.18ms Time], IncrementalHoareTripleChecker [30 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 69.79ms Time] [2021-11-07 22:44:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-07 22:44:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 182. [2021-11-07 22:44:14,723 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-07 22:44:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2021-11-07 22:44:14,724 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 62 [2021-11-07 22:44:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:14,725 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2021-11-07 22:44:14,725 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-07 22:44:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2021-11-07 22:44:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 22:44:14,728 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:14,728 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-07 22:44:14,740 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-07 22:44:14,938 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-07 22:44:14,939 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:14,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:14,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1777715509, now seen corresponding path program 1 times [2021-11-07 22:44:14,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:14,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422129853] [2021-11-07 22:44:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:14,940 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:14,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:14,941 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-07 22:44:14,942 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-07 22:44:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:15,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:44:15,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:15,351 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-07 22:44:15,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:15,590 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-07 22:44:15,590 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:15,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422129853] [2021-11-07 22:44:15,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422129853] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:44:15,591 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:15,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 22:44:15,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033450325] [2021-11-07 22:44:15,591 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:44:15,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 22:44:15,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 22:44:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 22:44:15,592 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-07 22:44:16,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:16,243 INFO L93 Difference]: Finished difference Result 470 states and 590 transitions. [2021-11-07 22:44:16,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 22:44:16,244 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-07 22:44:16,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:16,245 INFO L225 Difference]: With dead ends: 470 [2021-11-07 22:44:16,245 INFO L226 Difference]: Without dead ends: 292 [2021-11-07 22:44:16,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.63ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 22:44:16,246 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 101 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 595.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.12ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 633.20ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:16,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 451 Invalid, 36 Unknown, 0 Unchecked, 1.12ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 633.20ms Time] [2021-11-07 22:44:16,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-07 22:44:16,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 285. [2021-11-07 22:44:16,254 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-07 22:44:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 358 transitions. [2021-11-07 22:44:16,255 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 358 transitions. Word has length 62 [2021-11-07 22:44:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:16,257 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 358 transitions. [2021-11-07 22:44:16,257 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-07 22:44:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 358 transitions. [2021-11-07 22:44:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 22:44:16,258 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:16,258 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-07 22:44:16,268 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-07 22:44:16,463 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-07 22:44:16,463 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:16,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1300403396, now seen corresponding path program 1 times [2021-11-07 22:44:16,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:16,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069668722] [2021-11-07 22:44:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:16,465 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:16,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:16,466 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-07 22:44:16,467 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-07 22:44:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:16,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:44:16,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:16,735 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-07 22:44:16,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:16,824 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-07 22:44:16,824 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:16,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069668722] [2021-11-07 22:44:16,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069668722] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:44:16,824 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:16,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 22:44:16,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158828927] [2021-11-07 22:44:16,824 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:44:16,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 22:44:16,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:16,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 22:44:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 22:44:16,825 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-07 22:44:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:16,869 INFO L93 Difference]: Finished difference Result 528 states and 673 transitions. [2021-11-07 22:44:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:44:16,883 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-07 22:44:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:16,885 INFO L225 Difference]: With dead ends: 528 [2021-11-07 22:44:16,885 INFO L226 Difference]: Without dead ends: 288 [2021-11-07 22:44:16,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.89ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 22:44:16,886 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.68ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.60ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:16,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 14 Unknown, 0 Unchecked, 0.68ms Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 37.60ms Time] [2021-11-07 22:44:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-11-07 22:44:16,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-11-07 22:44:16,904 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-07 22:44:16,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 361 transitions. [2021-11-07 22:44:16,905 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 361 transitions. Word has length 69 [2021-11-07 22:44:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:16,905 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 361 transitions. [2021-11-07 22:44:16,905 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-07 22:44:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 361 transitions. [2021-11-07 22:44:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 22:44:16,906 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:16,907 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-07 22:44:16,916 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-07 22:44:17,116 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-07 22:44:17,117 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:17,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash 982130832, now seen corresponding path program 1 times [2021-11-07 22:44:17,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:17,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816467239] [2021-11-07 22:44:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:17,119 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:17,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:17,119 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-07 22:44:17,121 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-07 22:44:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:17,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 22:44:17,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:17,418 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-07 22:44:17,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:17,551 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-07 22:44:17,551 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:17,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816467239] [2021-11-07 22:44:17,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816467239] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 22:44:17,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 22:44:17,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-07 22:44:17,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968425701] [2021-11-07 22:44:17,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 22:44:17,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 22:44:17,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:17,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 22:44:17,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 22:44:17,553 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-07 22:44:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:17,737 INFO L93 Difference]: Finished difference Result 537 states and 685 transitions. [2021-11-07 22:44:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 22:44:17,738 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-07 22:44:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:17,739 INFO L225 Difference]: With dead ends: 537 [2021-11-07 22:44:17,739 INFO L226 Difference]: Without dead ends: 294 [2021-11-07 22:44:17,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 112.17ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-07 22:44:17,742 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.32ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.52ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:17,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 855 Invalid, 50 Unknown, 0 Unchecked, 1.32ms Time], IncrementalHoareTripleChecker [13 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 117.52ms Time] [2021-11-07 22:44:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-07 22:44:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-07 22:44:17,756 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-07 22:44:17,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2021-11-07 22:44:17,757 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 72 [2021-11-07 22:44:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:17,760 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2021-11-07 22:44:17,760 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-07 22:44:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2021-11-07 22:44:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-07 22:44:17,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:17,765 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-07 22:44:17,775 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-07 22:44:17,976 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-07 22:44:17,977 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:17,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2058438736, now seen corresponding path program 2 times [2021-11-07 22:44:17,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:17,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724016740] [2021-11-07 22:44:17,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 22:44:17,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:17,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:17,979 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-07 22:44:17,979 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-07 22:44:18,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-07 22:44:18,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 22:44:18,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:44:18,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:18,172 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-07 22:44:18,180 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-07 22:44:18,190 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-07 22:44:18,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:18,287 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-07 22:44:18,287 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:18,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724016740] [2021-11-07 22:44:18,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724016740] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:44:18,288 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:18,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 22:44:18,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472664310] [2021-11-07 22:44:18,288 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:44:18,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 22:44:18,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:18,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 22:44:18,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 22:44:18,289 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-07 22:44:19,992 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 22:44:22,218 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 22:44:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:22,771 INFO L93 Difference]: Finished difference Result 448 states and 571 transitions. [2021-11-07 22:44:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 22:44:22,772 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-07 22:44:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:22,774 INFO L225 Difference]: With dead ends: 448 [2021-11-07 22:44:22,774 INFO L226 Difference]: Without dead ends: 444 [2021-11-07 22:44:22,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 25.02ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-07 22:44:22,775 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 207 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4257.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.43ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4440.71ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:22,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 927 Invalid, 274 Unknown, 0 Unchecked, 4.43ms Time], IncrementalHoareTripleChecker [6 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 4440.71ms Time] [2021-11-07 22:44:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-11-07 22:44:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 365. [2021-11-07 22:44:22,782 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-07 22:44:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 463 transitions. [2021-11-07 22:44:22,783 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 463 transitions. Word has length 78 [2021-11-07 22:44:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:22,783 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 463 transitions. [2021-11-07 22:44:22,783 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-07 22:44:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 463 transitions. [2021-11-07 22:44:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-07 22:44:22,784 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:22,784 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-07 22:44:22,792 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-07 22:44:22,992 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-07 22:44:22,992 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:22,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1224331210, now seen corresponding path program 1 times [2021-11-07 22:44:22,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:22,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917906368] [2021-11-07 22:44:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:22,994 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:22,995 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-07 22:44:22,995 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-07 22:44:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:23,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 22:44:23,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:23,452 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-07 22:44:23,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:23,961 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-07 22:44:23,961 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:23,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917906368] [2021-11-07 22:44:23,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917906368] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 22:44:23,962 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 22:44:23,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-11-07 22:44:23,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001987656] [2021-11-07 22:44:23,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 22:44:23,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-07 22:44:23,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-07 22:44:23,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-07 22:44:23,963 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-07 22:44:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:25,281 INFO L93 Difference]: Finished difference Result 697 states and 901 transitions. [2021-11-07 22:44:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 22:44:25,282 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-07 22:44:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:25,283 INFO L225 Difference]: With dead ends: 697 [2021-11-07 22:44:25,283 INFO L226 Difference]: Without dead ends: 377 [2021-11-07 22:44:25,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 775.71ms TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2021-11-07 22:44:25,284 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 817.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.50ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 868.76ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:25,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1703 Invalid, 158 Unknown, 0 Unchecked, 2.50ms Time], IncrementalHoareTripleChecker [45 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 868.76ms Time] [2021-11-07 22:44:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-11-07 22:44:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-11-07 22:44:25,293 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-07 22:44:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 475 transitions. [2021-11-07 22:44:25,294 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 475 transitions. Word has length 112 [2021-11-07 22:44:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:25,295 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 475 transitions. [2021-11-07 22:44:25,296 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-07 22:44:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 475 transitions. [2021-11-07 22:44:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-07 22:44:25,297 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:25,297 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-07 22:44:25,311 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-07 22:44:25,508 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-07 22:44:25,508 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2016870474, now seen corresponding path program 2 times [2021-11-07 22:44:25,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:25,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254799780] [2021-11-07 22:44:25,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 22:44:25,509 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:25,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:25,510 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-07 22:44:25,511 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-07 22:44:25,629 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-07 22:44:25,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 22:44:25,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:44:25,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:25,786 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-07 22:44:25,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:25,946 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-07 22:44:25,947 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:25,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254799780] [2021-11-07 22:44:25,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254799780] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:44:25,947 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:25,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-11-07 22:44:25,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014392846] [2021-11-07 22:44:25,947 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:44:25,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 22:44:25,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:25,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 22:44:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:44:25,948 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-07 22:44:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:26,052 INFO L93 Difference]: Finished difference Result 603 states and 784 transitions. [2021-11-07 22:44:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:44:26,052 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-07 22:44:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:26,054 INFO L225 Difference]: With dead ends: 603 [2021-11-07 22:44:26,054 INFO L226 Difference]: Without dead ends: 389 [2021-11-07 22:44:26,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.85ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 22:44:26,057 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 101 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.96ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.62ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:26,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 604 Invalid, 68 Unknown, 0 Unchecked, 0.96ms Time], IncrementalHoareTripleChecker [30 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 85.62ms Time] [2021-11-07 22:44:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-11-07 22:44:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2021-11-07 22:44:26,065 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-07 22:44:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 460 transitions. [2021-11-07 22:44:26,066 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 460 transitions. Word has length 124 [2021-11-07 22:44:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:26,066 INFO L470 AbstractCegarLoop]: Abstraction has 386 states and 460 transitions. [2021-11-07 22:44:26,067 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-07 22:44:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 460 transitions. [2021-11-07 22:44:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-07 22:44:26,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:26,069 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-07 22:44:26,080 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-07 22:44:26,278 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-07 22:44:26,278 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:26,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:26,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1333208362, now seen corresponding path program 1 times [2021-11-07 22:44:26,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:26,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982536937] [2021-11-07 22:44:26,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:26,279 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:26,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:26,280 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-07 22:44:26,283 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-07 22:44:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:26,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-07 22:44:26,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:26,980 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-07 22:44:26,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:27,984 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-07 22:44:27,985 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:27,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982536937] [2021-11-07 22:44:27,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982536937] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 22:44:27,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 22:44:27,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-11-07 22:44:27,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023125152] [2021-11-07 22:44:27,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 22:44:27,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-07 22:44:27,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:27,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-07 22:44:27,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2021-11-07 22:44:27,988 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-07 22:44:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:37,039 INFO L93 Difference]: Finished difference Result 751 states and 919 transitions. [2021-11-07 22:44:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 22:44:37,040 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-07 22:44:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:37,041 INFO L225 Difference]: With dead ends: 751 [2021-11-07 22:44:37,041 INFO L226 Difference]: Without dead ends: 410 [2021-11-07 22:44:37,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 3935.36ms TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2021-11-07 22:44:37,043 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5816.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3826 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.30ms SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6028.11ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:37,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 3826 Invalid, 536 Unknown, 0 Unchecked, 6.30ms Time], IncrementalHoareTripleChecker [157 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 6028.11ms Time] [2021-11-07 22:44:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-11-07 22:44:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-11-07 22:44:37,052 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-07 22:44:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2021-11-07 22:44:37,053 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 124 [2021-11-07 22:44:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:37,054 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2021-11-07 22:44:37,054 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-07 22:44:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2021-11-07 22:44:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-07 22:44:37,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:37,055 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-07 22:44:37,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-07 22:44:37,267 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-07 22:44:37,267 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:37,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2039593942, now seen corresponding path program 2 times [2021-11-07 22:44:37,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:37,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471631807] [2021-11-07 22:44:37,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 22:44:37,268 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:37,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:37,269 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-07 22:44:37,270 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-07 22:44:37,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-07 22:44:37,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 22:44:37,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 22:44:37,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:37,574 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-07 22:44:37,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:37,777 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-07 22:44:37,777 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:37,777 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471631807] [2021-11-07 22:44:37,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471631807] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:44:37,777 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:44:37,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [] total 5 [2021-11-07 22:44:37,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633574896] [2021-11-07 22:44:37,777 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:44:37,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 22:44:37,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:37,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 22:44:37,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:44:37,779 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-07 22:44:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:44:37,849 INFO L93 Difference]: Finished difference Result 611 states and 731 transitions. [2021-11-07 22:44:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 22:44:37,850 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-07 22:44:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:44:37,851 INFO L225 Difference]: With dead ends: 611 [2021-11-07 22:44:37,851 INFO L226 Difference]: Without dead ends: 413 [2021-11-07 22:44:37,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.54ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:44:37,852 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 3 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.67ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.93ms IncrementalHoareTripleChecker+Time [2021-11-07 22:44:37,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 746 Invalid, 88 Unknown, 0 Unchecked, 0.67ms Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 60.93ms Time] [2021-11-07 22:44:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2021-11-07 22:44:37,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2021-11-07 22:44:37,861 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-07 22:44:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 475 transitions. [2021-11-07 22:44:37,862 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 475 transitions. Word has length 148 [2021-11-07 22:44:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:44:37,862 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 475 transitions. [2021-11-07 22:44:37,862 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-07 22:44:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 475 transitions. [2021-11-07 22:44:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-11-07 22:44:37,863 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:44:37,863 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-07 22:44:37,875 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-07 22:44:38,071 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-07 22:44:38,071 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:44:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:44:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1997207916, now seen corresponding path program 1 times [2021-11-07 22:44:38,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:44:38,072 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830610367] [2021-11-07 22:44:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:44:38,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:44:38,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:44:38,073 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-07 22:44:38,075 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-07 22:44:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:44:38,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 33 conjunts are in the unsatisfiable core [2021-11-07 22:44:38,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:44:39,283 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-07 22:44:39,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:44:42,050 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-07 22:44:42,050 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:44:42,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830610367] [2021-11-07 22:44:42,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830610367] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 22:44:42,050 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 22:44:42,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2021-11-07 22:44:42,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8946442] [2021-11-07 22:44:42,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 22:44:42,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-07 22:44:42,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:44:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-07 22:44:42,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=3099, Unknown=0, NotChecked=0, Total=4032 [2021-11-07 22:44:42,053 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-07 22:45:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:45:47,446 INFO L93 Difference]: Finished difference Result 805 states and 961 transitions. [2021-11-07 22:45:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-11-07 22:45:47,447 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-07 22:45:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:45:47,449 INFO L225 Difference]: With dead ends: 805 [2021-11-07 22:45:47,449 INFO L226 Difference]: Without dead ends: 440 [2021-11-07 22:45:47,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 25836.14ms TimeCoverageRelationStatistics Valid=2700, Invalid=6042, Unknown=0, NotChecked=0, Total=8742 [2021-11-07 22:45:47,451 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 7035 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41850.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7243 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.04ms SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42530.44ms IncrementalHoareTripleChecker+Time [2021-11-07 22:45:47,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7243 Invalid, 1673 Unknown, 0 Unchecked, 15.04ms Time], IncrementalHoareTripleChecker [555 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 42530.44ms Time] [2021-11-07 22:45:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-11-07 22:45:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-11-07 22:45:47,462 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-07 22:45:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2021-11-07 22:45:47,463 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 148 [2021-11-07 22:45:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:45:47,464 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2021-11-07 22:45:47,464 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-07 22:45:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2021-11-07 22:45:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-11-07 22:45:47,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:45:47,465 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-07 22:45:47,479 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-07 22:45:47,678 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-07 22:45:47,679 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:45:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:45:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1100843980, now seen corresponding path program 2 times [2021-11-07 22:45:47,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:45:47,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048603443] [2021-11-07 22:45:47,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 22:45:47,681 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:45:47,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:45:47,682 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-07 22:45:47,683 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-07 22:45:48,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 22:45:48,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 22:45:48,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 34 conjunts are in the unsatisfiable core [2021-11-07 22:45:48,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:45:49,423 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-07 22:45:49,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:45:52,856 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-07 22:45:52,856 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:45:52,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048603443] [2021-11-07 22:45:52,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048603443] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 22:45:52,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 22:45:52,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 66 [2021-11-07 22:45:52,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210212232] [2021-11-07 22:45:52,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 22:45:52,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-11-07 22:45:52,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:45:52,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-11-07 22:45:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=3137, Unknown=0, NotChecked=0, Total=4290 [2021-11-07 22:45:52,859 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-07 22:47:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:47:06,571 INFO L93 Difference]: Finished difference Result 868 states and 1027 transitions. [2021-11-07 22:47:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-07 22:47:06,572 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-07 22:47:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:47:06,574 INFO L225 Difference]: With dead ends: 868 [2021-11-07 22:47:06,574 INFO L226 Difference]: Without dead ends: 473 [2021-11-07 22:47:06,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 29788.47ms TimeCoverageRelationStatistics Valid=3199, Invalid=6113, Unknown=0, NotChecked=0, Total=9312 [2021-11-07 22:47:06,576 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 7035 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46649.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7243 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.28ms SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47471.98ms IncrementalHoareTripleChecker+Time [2021-11-07 22:47:06,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7243 Invalid, 1922 Unknown, 0 Unchecked, 15.28ms Time], IncrementalHoareTripleChecker [591 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 47471.98ms Time] [2021-11-07 22:47:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-11-07 22:47:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2021-11-07 22:47:06,596 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-07 22:47:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 538 transitions. [2021-11-07 22:47:06,597 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 538 transitions. Word has length 178 [2021-11-07 22:47:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:47:06,597 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 538 transitions. [2021-11-07 22:47:06,598 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-07 22:47:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 538 transitions. [2021-11-07 22:47:06,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2021-11-07 22:47:06,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:47:06,599 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-07 22:47:06,619 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-07 22:47:06,815 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-07 22:47:06,815 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:47:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:47:06,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1145284768, now seen corresponding path program 3 times [2021-11-07 22:47:06,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:47:06,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954280652] [2021-11-07 22:47:06,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 22:47:06,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:47:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:47:06,818 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-07 22:47:06,819 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-07 22:47:07,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-07 22:47:07,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 22:47:07,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 22:47:07,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:47:07,474 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-07 22:47:07,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:47:07,908 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-07 22:47:07,909 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:47:07,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954280652] [2021-11-07 22:47:07,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954280652] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 22:47:07,909 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 22:47:07,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-07 22:47:07,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550475868] [2021-11-07 22:47:07,909 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 22:47:07,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 22:47:07,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:47:07,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 22:47:07,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 22:47:07,910 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-07 22:47:09,099 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-07 22:47:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:47:10,668 INFO L93 Difference]: Finished difference Result 983 states and 1122 transitions. [2021-11-07 22:47:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 22:47:10,668 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-07 22:47:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:47:10,670 INFO L225 Difference]: With dead ends: 983 [2021-11-07 22:47:10,670 INFO L226 Difference]: Without dead ends: 555 [2021-11-07 22:47:10,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 22:47:10,671 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 395 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2594.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.38ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2725.64ms IncrementalHoareTripleChecker+Time [2021-11-07 22:47:10,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 335 Invalid, 83 Unknown, 0 Unchecked, 1.38ms Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 2725.64ms Time] [2021-11-07 22:47:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-07 22:47:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 548. [2021-11-07 22:47:10,693 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-07 22:47:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 625 transitions. [2021-11-07 22:47:10,694 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 625 transitions. Word has length 211 [2021-11-07 22:47:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:47:10,695 INFO L470 AbstractCegarLoop]: Abstraction has 548 states and 625 transitions. [2021-11-07 22:47:10,695 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-07 22:47:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 625 transitions. [2021-11-07 22:47:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-11-07 22:47:10,696 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:47:10,696 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-07 22:47:10,709 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-07 22:47:10,906 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-07 22:47:10,906 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:47:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:47:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 670931834, now seen corresponding path program 1 times [2021-11-07 22:47:10,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:47:10,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468445870] [2021-11-07 22:47:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 22:47:10,908 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:47:10,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:47:10,909 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-07 22:47:10,910 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-07 22:47:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 22:47:11,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 67 conjunts are in the unsatisfiable core [2021-11-07 22:47:11,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:47:14,654 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-07 22:47:14,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:47:26,308 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-07 22:47:26,308 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:47:26,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468445870] [2021-11-07 22:47:26,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468445870] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 22:47:26,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 22:47:26,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 132 [2021-11-07 22:47:26,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170549088] [2021-11-07 22:47:26,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 22:47:26,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-07 22:47:26,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:47:26,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-07 22:47:26,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4486, Invalid=12806, Unknown=0, NotChecked=0, Total=17292 [2021-11-07 22:47:26,313 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-07 22:50:59,206 WARN L227 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 22:51:07,606 WARN L227 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 22:51:15,463 WARN L227 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-07 22:51:17,560 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-07 22:52:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 22:52:41,772 INFO L93 Difference]: Finished difference Result 1003 states and 1217 transitions. [2021-11-07 22:52:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-07 22:52:41,774 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-07 22:52:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 22:52:41,775 INFO L225 Difference]: With dead ends: 1003 [2021-11-07 22:52:41,775 INFO L226 Difference]: Without dead ends: 614 [2021-11-07 22:52:41,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 211126.74ms TimeCoverageRelationStatistics Valid=12746, Invalid=25087, Unknown=1, NotChecked=386, Total=38220 [2021-11-07 22:52:41,781 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 13869 mSDsCounter, 0 mSdLazyCounter, 4795 mSolverCounterSat, 1119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 115020.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14077 SdHoareTripleChecker+Invalid, 5915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 25.15ms SdHoareTripleChecker+Time, 1119 IncrementalHoareTripleChecker+Valid, 4795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 117334.65ms IncrementalHoareTripleChecker+Time [2021-11-07 22:52:41,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14077 Invalid, 5915 Unknown, 0 Unchecked, 25.15ms Time], IncrementalHoareTripleChecker [1119 Valid, 4795 Invalid, 0 Unknown, 1 Unchecked, 117334.65ms Time] [2021-11-07 22:52:41,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-11-07 22:52:41,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-11-07 22:52:41,810 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-07 22:52:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 691 transitions. [2021-11-07 22:52:41,811 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 691 transitions. Word has length 218 [2021-11-07 22:52:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 22:52:41,812 INFO L470 AbstractCegarLoop]: Abstraction has 614 states and 691 transitions. [2021-11-07 22:52:41,812 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-07 22:52:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 691 transitions. [2021-11-07 22:52:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-11-07 22:52:41,813 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 22:52:41,813 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-07 22:52:41,831 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-07 22:52:42,031 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-07 22:52:42,031 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 22:52:42,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 22:52:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash 249759226, now seen corresponding path program 2 times [2021-11-07 22:52:42,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 22:52:42,033 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886976242] [2021-11-07 22:52:42,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 22:52:42,033 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 22:52:42,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 22:52:42,034 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-07 22:52:42,036 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-07 22:52:43,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 22:52:43,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 22:52:43,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-07 22:52:43,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 22:52:52,839 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-07 22:52:52,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 22:53:31,109 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-07 22:53:31,110 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 22:53:31,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886976242] [2021-11-07 22:53:31,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886976242] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 22:53:31,110 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 22:53:31,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 264 [2021-11-07 22:53:31,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742152122] [2021-11-07 22:53:31,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 22:53:31,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 264 states [2021-11-07 22:53:31,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 22:53:31,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 264 interpolants. [2021-11-07 22:53:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17686, Invalid=51746, Unknown=0, NotChecked=0, Total=69432 [2021-11-07 22:53:31,123 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