./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/xor5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/array-crafted/xor5.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 a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 22:42:12,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 22:42:12,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 22:42:12,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 22:42:12,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 22:42:12,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 22:42:12,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 22:42:12,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 22:42:12,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 22:42:12,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 22:42:12,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 22:42:12,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 22:42:12,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 22:42:12,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 22:42:12,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 22:42:12,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 22:42:12,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 22:42:12,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 22:42:12,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 22:42:12,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 22:42:12,711 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 22:42:12,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 22:42:12,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 22:42:12,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 22:42:12,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 22:42:12,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 22:42:12,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 22:42:12,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 22:42:12,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 22:42:12,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 22:42:12,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 22:42:12,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 22:42:12,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 22:42:12,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 22:42:12,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 22:42:12,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 22:42:12,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 22:42:12,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 22:42:12,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 22:42:12,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 22:42:12,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 22:42:12,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 22:42:12,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 22:42:12,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 22:42:12,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 22:42:12,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 22:42:12,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 22:42:12,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 22:42:12,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 22:42:12,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 22:42:12,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 22:42:12,757 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 22:42:12,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 22:42:12,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 22:42:12,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 22:42:12,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 22:42:12,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 22:42:12,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 22:42:12,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 22:42:12,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 22:42:12,759 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 22:42:12,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 22:42:12,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 22:42:12,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 22:42:12,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 22:42:12,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 22:42:12,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 22:42:12,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:42:12,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 22:42:12,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 22:42:12,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 22:42:12,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 22:42:12,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 22:42:12,761 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 22:42:12,761 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 22:42:12,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 22:42:12,761 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 -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2022-07-11 22:42:12,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 22:42:12,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 22:42:12,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 22:42:12,938 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 22:42:12,939 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 22:42:12,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2022-07-11 22:42:12,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6288505b9/2820300bb23f42dab95cf0ab06683814/FLAG6006e4411 [2022-07-11 22:42:13,325 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 22:42:13,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2022-07-11 22:42:13,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6288505b9/2820300bb23f42dab95cf0ab06683814/FLAG6006e4411 [2022-07-11 22:42:13,337 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6288505b9/2820300bb23f42dab95cf0ab06683814 [2022-07-11 22:42:13,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 22:42:13,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 22:42:13,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 22:42:13,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 22:42:13,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 22:42:13,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d29c377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13, skipping insertion in model container [2022-07-11 22:42:13,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 22:42:13,357 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 22:42:13,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-11 22:42:13,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:42:13,541 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 22:42:13,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-11 22:42:13,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:42:13,570 INFO L208 MainTranslator]: Completed translation [2022-07-11 22:42:13,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13 WrapperNode [2022-07-11 22:42:13,570 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 22:42:13,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 22:42:13,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 22:42:13,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 22:42:13,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,610 INFO L137 Inliner]: procedures = 16, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2022-07-11 22:42:13,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 22:42:13,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 22:42:13,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 22:42:13,611 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 22:42:13,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 22:42:13,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 22:42:13,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 22:42:13,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 22:42:13,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (1/1) ... [2022-07-11 22:42:13,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:42:13,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:42:13,651 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) [2022-07-11 22:42:13,656 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 [2022-07-11 22:42:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 22:42:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 22:42:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 22:42:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 22:42:13,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 22:42:13,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 22:42:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 22:42:13,689 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-07-11 22:42:13,689 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-07-11 22:42:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 22:42:13,749 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 22:42:13,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 22:42:13,870 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 22:42:13,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 22:42:13,875 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 22:42:13,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:42:13 BoogieIcfgContainer [2022-07-11 22:42:13,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 22:42:13,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 22:42:13,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 22:42:13,893 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 22:42:13,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 10:42:13" (1/3) ... [2022-07-11 22:42:13,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fdd3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:42:13, skipping insertion in model container [2022-07-11 22:42:13,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:13" (2/3) ... [2022-07-11 22:42:13,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fdd3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:42:13, skipping insertion in model container [2022-07-11 22:42:13,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:42:13" (3/3) ... [2022-07-11 22:42:13,900 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2022-07-11 22:42:13,917 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 22:42:13,917 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 22:42:13,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 22:42:13,967 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f4a85b4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36d57ca [2022-07-11 22:42:13,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 22:42:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 22:42:13,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:13,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:13,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2022-07-11 22:42:13,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:42:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696790486] [2022-07-11 22:42:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:42:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 22:42:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 22:42:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 22:42:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:42:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:42:14,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696790486] [2022-07-11 22:42:14,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696790486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:42:14,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:42:14,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 22:42:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713391787] [2022-07-11 22:42:14,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:42:14,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 22:42:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:42:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 22:42:14,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:42:14,212 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:14,233 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-07-11 22:42:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 22:42:14,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-11 22:42:14,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:14,241 INFO L225 Difference]: With dead ends: 51 [2022-07-11 22:42:14,242 INFO L226 Difference]: Without dead ends: 23 [2022-07-11 22:42:14,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:42:14,247 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:14,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:42:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-11 22:42:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-11 22:42:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-11 22:42:14,284 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2022-07-11 22:42:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:14,284 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-11 22:42:14,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-11 22:42:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 22:42:14,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:14,287 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:14,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 22:42:14,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2022-07-11 22:42:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:42:14,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747364191] [2022-07-11 22:42:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:14,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:42:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 22:42:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 22:42:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 22:42:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:42:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:42:14,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747364191] [2022-07-11 22:42:14,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747364191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:42:14,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:42:14,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:42:14,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696917016] [2022-07-11 22:42:14,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:42:14,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:42:14,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:42:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:42:14,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:42:14,420 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:14,452 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-11 22:42:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:42:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-11 22:42:14,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:14,455 INFO L225 Difference]: With dead ends: 43 [2022-07-11 22:42:14,455 INFO L226 Difference]: Without dead ends: 25 [2022-07-11 22:42:14,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:42:14,457 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:14,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:42:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-11 22:42:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-11 22:42:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-11 22:42:14,465 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-07-11 22:42:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:14,465 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-11 22:42:14,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-11 22:42:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 22:42:14,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:14,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:14,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 22:42:14,467 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:14,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2022-07-11 22:42:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:42:14,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117234509] [2022-07-11 22:42:14,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:14,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:42:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-11 22:42:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-11 22:42:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 22:42:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 22:42:14,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:42:14,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117234509] [2022-07-11 22:42:14,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117234509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:42:14,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819565164] [2022-07-11 22:42:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:42:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:42:14,555 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) [2022-07-11 22:42:14,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 22:42:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:14,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 22:42:14,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:42:14,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:42:14,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819565164] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:42:14,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 22:42:14,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-07-11 22:42:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344522707] [2022-07-11 22:42:14,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 22:42:14,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 22:42:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:42:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 22:42:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-11 22:42:14,746 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-11 22:42:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:14,808 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-07-11 22:42:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 22:42:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 31 [2022-07-11 22:42:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:14,809 INFO L225 Difference]: With dead ends: 47 [2022-07-11 22:42:14,809 INFO L226 Difference]: Without dead ends: 29 [2022-07-11 22:42:14,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-11 22:42:14,811 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:14,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:42:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-11 22:42:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-11 22:42:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-11 22:42:14,815 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 31 [2022-07-11 22:42:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:14,815 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-11 22:42:14,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-11 22:42:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-11 22:42:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 22:42:14,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:14,817 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:14,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-11 22:42:15,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:42:15,033 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:15,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:15,034 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2022-07-11 22:42:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:42:15,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336340595] [2022-07-11 22:42:15,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:42:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:15,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-11 22:42:15,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:15,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-11 22:42:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-11 22:42:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-11 22:42:15,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 22:42:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336340595] [2022-07-11 22:42:15,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336340595] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 22:42:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724808437] [2022-07-11 22:42:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:15,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 22:42:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:42:15,149 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) [2022-07-11 22:42:15,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 22:42:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:15,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 22:42:15,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-11 22:42:15,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:42:15,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724808437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:42:15,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 22:42:15,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-11 22:42:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209464001] [2022-07-11 22:42:15,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:42:15,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 22:42:15,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 22:42:15,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 22:42:15,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 22:42:15,290 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 22:42:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:15,324 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-11 22:42:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 22:42:15,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-11 22:42:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:15,326 INFO L225 Difference]: With dead ends: 42 [2022-07-11 22:42:15,328 INFO L226 Difference]: Without dead ends: 29 [2022-07-11 22:42:15,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 22:42:15,332 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:15,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:42:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-11 22:42:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-11 22:42:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-11 22:42:15,340 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2022-07-11 22:42:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:15,349 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-11 22:42:15,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-11 22:42:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-11 22:42:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 22:42:15,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:15,350 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:15,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-11 22:42:15,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-11 22:42:15,557 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2022-07-11 22:42:15,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 22:42:15,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762763697] [2022-07-11 22:42:15,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:15,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 22:42:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 22:42:15,619 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-11 22:42:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-11 22:42:15,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-11 22:42:15,657 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-11 22:42:15,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 22:42:15,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 22:42:15,661 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-11 22:42:15,663 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 22:42:15,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 10:42:15 BoogieIcfgContainer [2022-07-11 22:42:15,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 22:42:15,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 22:42:15,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 22:42:15,688 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 22:42:15,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:42:13" (3/4) ... [2022-07-11 22:42:15,690 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-11 22:42:15,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 22:42:15,690 INFO L158 Benchmark]: Toolchain (without parser) took 2350.82ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 73.5MB in the beginning and 79.2MB in the end (delta: -5.7MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2022-07-11 22:42:15,691 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 22:42:15,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.08ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 73.2MB in the beginning and 128.9MB in the end (delta: -55.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 22:42:15,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.34ms. Allocated memory is still 155.2MB. Free memory was 128.1MB in the beginning and 126.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 22:42:15,691 INFO L158 Benchmark]: Boogie Preprocessor took 17.86ms. Allocated memory is still 155.2MB. Free memory was 126.8MB in the beginning and 125.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 22:42:15,692 INFO L158 Benchmark]: RCFGBuilder took 251.01ms. Allocated memory is still 155.2MB. Free memory was 125.4MB in the beginning and 114.2MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 22:42:15,692 INFO L158 Benchmark]: TraceAbstraction took 1797.16ms. Allocated memory is still 155.2MB. Free memory was 113.5MB in the beginning and 80.3MB in the end (delta: 33.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2022-07-11 22:42:15,692 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 22:42:15,693 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.16ms. Allocated memory is still 104.9MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.08ms. Allocated memory was 104.9MB in the beginning and 155.2MB in the end (delta: 50.3MB). Free memory was 73.2MB in the beginning and 128.9MB in the end (delta: -55.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.34ms. Allocated memory is still 155.2MB. Free memory was 128.1MB in the beginning and 126.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.86ms. Allocated memory is still 155.2MB. Free memory was 126.8MB in the beginning and 125.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 251.01ms. Allocated memory is still 155.2MB. Free memory was 125.4MB in the beginning and 114.2MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1797.16ms. Allocated memory is still 155.2MB. Free memory was 113.5MB in the beginning and 80.3MB in the end (delta: 33.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseXOr at line 25. Possible FailurePath: [L17] int N; VAL [N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [i=0, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=1, N=2, x={9:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [i=2, N=2, x={9:0}] [L40] COND FALSE !(i < N) VAL [i=2, N=2, x={9:0}] [L45] CALL, EXPR xor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=-1, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res ^ x[i] [L24] i++ VAL [i=2, N=2, res=0, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, res=0, x={9:0}, x={9:0}] [L27] return res; VAL [\result=0, i=2, N=2, res=0, x={9:0}, x={9:0}] [L45] RET, EXPR xor(x) VAL [i=2, N=2, x={9:0}, xor(x)=0] [L45] ret = xor(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [i=2, N=2, ret=0, temp=-1, x={9:0}] [L48] CALL, EXPR xor(x) VAL [N=2, x={9:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [i=1, N=2, res=1, x={9:0}, x={9:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res ^ x[i] [L24] i++ VAL [i=2, N=2, res=1, x={9:0}, x={9:0}] [L24] COND FALSE !(i < N) VAL [i=2, N=2, res=1, x={9:0}, x={9:0}] [L27] return res; VAL [\result=1, i=2, N=2, res=1, x={9:0}, x={9:0}] [L48] RET, EXPR xor(x) VAL [i=2, N=2, ret=0, temp=-1, x={9:0}, xor(x)=1] [L48] ret2 = xor(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [i=0, i=2, N=2, ret=0, ret2=1, temp=1, x={9:0}] [L50] COND TRUE i 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 -> a4ee2cdc1f0cbbd62309a70b71e98ce771ffa71f4ebd85e731799a93fbbc3919 [2022-07-11 22:42:17,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 22:42:17,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 22:42:17,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 22:42:17,997 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 22:42:17,997 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 22:42:17,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/xor5.i [2022-07-11 22:42:18,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156ddbf2c/2e1eff98ce6249adb861a21d01856385/FLAG041822145 [2022-07-11 22:42:18,340 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 22:42:18,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i [2022-07-11 22:42:18,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156ddbf2c/2e1eff98ce6249adb861a21d01856385/FLAG041822145 [2022-07-11 22:42:18,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156ddbf2c/2e1eff98ce6249adb861a21d01856385 [2022-07-11 22:42:18,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 22:42:18,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 22:42:18,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 22:42:18,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 22:42:18,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 22:42:18,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:18,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d728ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18, skipping insertion in model container [2022-07-11 22:42:18,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:18,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 22:42:18,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 22:42:18,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-11 22:42:18,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:42:18,930 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 22:42:18,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/xor5.i[1364,1377] [2022-07-11 22:42:18,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 22:42:18,983 INFO L208 MainTranslator]: Completed translation [2022-07-11 22:42:18,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18 WrapperNode [2022-07-11 22:42:18,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 22:42:18,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 22:42:18,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 22:42:18,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 22:42:18,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:18,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,005 INFO L137 Inliner]: procedures = 18, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 72 [2022-07-11 22:42:19,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 22:42:19,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 22:42:19,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 22:42:19,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 22:42:19,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 22:42:19,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 22:42:19,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 22:42:19,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 22:42:19,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (1/1) ... [2022-07-11 22:42:19,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 22:42:19,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 22:42:19,049 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) [2022-07-11 22:42:19,055 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 [2022-07-11 22:42:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 22:42:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 22:42:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 22:42:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-11 22:42:19,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 22:42:19,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 22:42:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2022-07-11 22:42:19,083 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2022-07-11 22:42:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 22:42:19,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-11 22:42:19,141 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 22:42:19,142 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 22:42:19,322 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 22:42:19,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 22:42:19,327 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 22:42:19,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:42:19 BoogieIcfgContainer [2022-07-11 22:42:19,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 22:42:19,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 22:42:19,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 22:42:19,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 22:42:19,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 10:42:18" (1/3) ... [2022-07-11 22:42:19,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0df5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:42:19, skipping insertion in model container [2022-07-11 22:42:19,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 10:42:18" (2/3) ... [2022-07-11 22:42:19,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0df5ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 10:42:19, skipping insertion in model container [2022-07-11 22:42:19,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 10:42:19" (3/3) ... [2022-07-11 22:42:19,340 INFO L111 eAbstractionObserver]: Analyzing ICFG xor5.i [2022-07-11 22:42:19,358 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 22:42:19,359 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 22:42:19,411 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 22:42:19,421 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a2b97d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a5cba82 [2022-07-11 22:42:19,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 22:42:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 22:42:19,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:19,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:19,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2030793856, now seen corresponding path program 1 times [2022-07-11 22:42:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:19,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778136186] [2022-07-11 22:42:19,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:19,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:19,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:19,457 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) [2022-07-11 22:42:19,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-11 22:42:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:19,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-11 22:42:19,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 22:42:19,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:42:19,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:19,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778136186] [2022-07-11 22:42:19,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778136186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:42:19,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:42:19,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 22:42:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478693300] [2022-07-11 22:42:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:42:19,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 22:42:19,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:19,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 22:42:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:42:19,651 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:19,669 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-07-11 22:42:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 22:42:19,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-11 22:42:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:19,675 INFO L225 Difference]: With dead ends: 51 [2022-07-11 22:42:19,675 INFO L226 Difference]: Without dead ends: 23 [2022-07-11 22:42:19,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 22:42:19,682 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:19,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:42:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-11 22:42:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-11 22:42:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-11 22:42:19,721 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2022-07-11 22:42:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:19,722 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-11 22:42:19,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-11 22:42:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 22:42:19,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:19,725 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:19,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:19,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:19,926 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:19,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1398988038, now seen corresponding path program 1 times [2022-07-11 22:42:19,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:19,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969557223] [2022-07-11 22:42:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:19,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:19,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:19,948 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) [2022-07-11 22:42:19,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-11 22:42:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:20,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 22:42:20,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:42:20,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:42:20,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:20,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969557223] [2022-07-11 22:42:20,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969557223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:42:20,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:42:20,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 22:42:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729141807] [2022-07-11 22:42:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:42:20,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 22:42:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:20,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 22:42:20,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:42:20,095 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:20,137 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-07-11 22:42:20,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 22:42:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-11 22:42:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:20,138 INFO L225 Difference]: With dead ends: 43 [2022-07-11 22:42:20,138 INFO L226 Difference]: Without dead ends: 25 [2022-07-11 22:42:20,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 22:42:20,140 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:20,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:42:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-11 22:42:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-11 22:42:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-11 22:42:20,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-07-11 22:42:20,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:20,144 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-11 22:42:20,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-11 22:42:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-11 22:42:20,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:20,145 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:20,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:20,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:20,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1708163684, now seen corresponding path program 1 times [2022-07-11 22:42:20,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:20,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384498155] [2022-07-11 22:42:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:20,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:20,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:20,356 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) [2022-07-11 22:42:20,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-11 22:42:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:20,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-11 22:42:20,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:42:20,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-11 22:42:20,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:20,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384498155] [2022-07-11 22:42:20,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384498155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:42:20,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:42:20,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-11 22:42:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129854457] [2022-07-11 22:42:20,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:42:20,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 22:42:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:20,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 22:42:20,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 22:42:20,501 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-11 22:42:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:20,569 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-11 22:42:20,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 22:42:20,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 31 [2022-07-11 22:42:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:20,571 INFO L225 Difference]: With dead ends: 45 [2022-07-11 22:42:20,571 INFO L226 Difference]: Without dead ends: 27 [2022-07-11 22:42:20,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 22:42:20,572 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:20,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:42:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-11 22:42:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-11 22:42:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-11 22:42:20,582 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 31 [2022-07-11 22:42:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:20,583 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-11 22:42:20,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-11 22:42:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-11 22:42:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 22:42:20,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:20,586 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:20,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:20,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:20,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1821751230, now seen corresponding path program 2 times [2022-07-11 22:42:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:20,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879787797] [2022-07-11 22:42:20,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:42:20,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:20,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:20,810 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) [2022-07-11 22:42:20,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-11 22:42:20,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-11 22:42:20,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:42:20,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-11 22:42:20,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 22:42:20,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 22:42:20,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:20,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879787797] [2022-07-11 22:42:20,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879787797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 22:42:20,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 22:42:20,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 22:42:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851362557] [2022-07-11 22:42:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 22:42:20,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 22:42:20,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:20,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 22:42:20,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 22:42:20,928 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:20,965 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-07-11 22:42:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 22:42:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-07-11 22:42:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:20,967 INFO L225 Difference]: With dead ends: 45 [2022-07-11 22:42:20,967 INFO L226 Difference]: Without dead ends: 28 [2022-07-11 22:42:20,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 22:42:20,968 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:20,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 22:42:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-11 22:42:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-11 22:42:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-11 22:42:20,972 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-07-11 22:42:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:20,972 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-11 22:42:20,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 22:42:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-11 22:42:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 22:42:20,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:20,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:20,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-11 22:42:21,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:21,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:21,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash 533240604, now seen corresponding path program 1 times [2022-07-11 22:42:21,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:21,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924927593] [2022-07-11 22:42:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:21,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:21,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:21,184 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) [2022-07-11 22:42:21,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-11 22:42:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:21,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 22:42:21,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-11 22:42:21,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 22:42:21,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924927593] [2022-07-11 22:42:21,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924927593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:42:21,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:42:21,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-11 22:42:21,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481322464] [2022-07-11 22:42:21,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:42:21,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 22:42:21,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:21,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 22:42:21,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-11 22:42:21,633 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 22:42:21,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:21,851 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-07-11 22:42:21,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 22:42:21,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-07-11 22:42:21,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:21,853 INFO L225 Difference]: With dead ends: 65 [2022-07-11 22:42:21,853 INFO L226 Difference]: Without dead ends: 52 [2022-07-11 22:42:21,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2022-07-11 22:42:21,854 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:21,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 62 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 22:42:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-11 22:42:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2022-07-11 22:42:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-11 22:42:21,859 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 39 [2022-07-11 22:42:21,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:21,860 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-11 22:42:21,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 22:42:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-11 22:42:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 22:42:21,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:21,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:21,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:22,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:22,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:22,071 INFO L85 PathProgramCache]: Analyzing trace with hash 850880602, now seen corresponding path program 1 times [2022-07-11 22:42:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:22,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366920176] [2022-07-11 22:42:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 22:42:22,072 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:22,073 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) [2022-07-11 22:42:22,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-11 22:42:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 22:42:22,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-11 22:42:22,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:22,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:22,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:42:22,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2022-07-11 22:42:22,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:22,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:42:22,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 36 [2022-07-11 22:42:22,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:22,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 22:42:22,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:42:22,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 48 [2022-07-11 22:42:23,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:42:23,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 25 [2022-07-11 22:42:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-11 22:42:23,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:29,084 INFO L390 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 111 treesize of output 87 [2022-07-11 22:42:29,099 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-11 22:42:29,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 88 [2022-07-11 22:42:35,175 INFO L390 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 111 treesize of output 87 [2022-07-11 22:42:35,182 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-11 22:42:35,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 1 [2022-07-11 22:42:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 22:42:35,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:35,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366920176] [2022-07-11 22:42:35,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366920176] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:42:35,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:42:35,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2022-07-11 22:42:35,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013308333] [2022-07-11 22:42:35,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:42:35,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-11 22:42:35,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:35,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-11 22:42:35,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2022-07-11 22:42:35,557 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-11 22:42:38,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 22:42:42,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:42,149 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-07-11 22:42:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-11 22:42:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-07-11 22:42:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:42,152 INFO L225 Difference]: With dead ends: 83 [2022-07-11 22:42:42,152 INFO L226 Difference]: Without dead ends: 79 [2022-07-11 22:42:42,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=405, Invalid=2675, Unknown=0, NotChecked=0, Total=3080 [2022-07-11 22:42:42,154 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 89 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 105 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:42,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 193 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 645 Invalid, 1 Unknown, 50 Unchecked, 4.6s Time] [2022-07-11 22:42:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-11 22:42:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2022-07-11 22:42:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (12), 7 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-11 22:42:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2022-07-11 22:42:42,183 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 41 [2022-07-11 22:42:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:42,185 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2022-07-11 22:42:42,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 34 states have internal predecessors, (60), 6 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-11 22:42:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2022-07-11 22:42:42,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:42:42,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:42,188 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:42,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:42,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:42,390 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:42,390 INFO L85 PathProgramCache]: Analyzing trace with hash 88846840, now seen corresponding path program 2 times [2022-07-11 22:42:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:42,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742019783] [2022-07-11 22:42:42,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 22:42:42,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:42,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:42,392 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) [2022-07-11 22:42:42,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-11 22:42:42,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 22:42:42,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:42:42,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 22:42:42,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-11 22:42:42,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-11 22:42:43,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:43,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742019783] [2022-07-11 22:42:43,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742019783] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:42:43,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:42:43,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2022-07-11 22:42:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122661274] [2022-07-11 22:42:43,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:42:43,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 22:42:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 22:42:43,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-11 22:42:43,008 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-11 22:42:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:43,397 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2022-07-11 22:42:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 22:42:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-07-11 22:42:43,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:43,399 INFO L225 Difference]: With dead ends: 104 [2022-07-11 22:42:43,399 INFO L226 Difference]: Without dead ends: 78 [2022-07-11 22:42:43,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-11 22:42:43,400 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 107 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:43,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 175 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 22:42:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-11 22:42:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2022-07-11 22:42:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 42 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-11 22:42:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-07-11 22:42:43,407 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2022-07-11 22:42:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:43,407 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-07-11 22:42:43,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-11 22:42:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-07-11 22:42:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 22:42:43,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:43,408 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:43,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:43,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:43,609 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1417469948, now seen corresponding path program 3 times [2022-07-11 22:42:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:43,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032888019] [2022-07-11 22:42:43,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 22:42:43,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:43,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:43,615 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) [2022-07-11 22:42:43,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-11 22:42:43,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-11 22:42:43,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:42:43,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 22:42:43,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-11 22:42:43,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-11 22:42:43,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:43,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032888019] [2022-07-11 22:42:43,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032888019] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:42:43,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:42:43,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2022-07-11 22:42:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497299795] [2022-07-11 22:42:43,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:42:43,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 22:42:43,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:43,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 22:42:43,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-11 22:42:43,933 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-11 22:42:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:44,172 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-07-11 22:42:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 22:42:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-07-11 22:42:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:44,173 INFO L225 Difference]: With dead ends: 77 [2022-07-11 22:42:44,173 INFO L226 Difference]: Without dead ends: 58 [2022-07-11 22:42:44,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-11 22:42:44,174 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 125 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:44,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 127 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 22:42:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-11 22:42:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-07-11 22:42:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-11 22:42:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-11 22:42:44,180 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2022-07-11 22:42:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:44,181 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-11 22:42:44,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-11 22:42:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-11 22:42:44,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 22:42:44,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:44,181 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:44,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:44,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:44,391 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:44,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2102516822, now seen corresponding path program 4 times [2022-07-11 22:42:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:44,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104032113] [2022-07-11 22:42:44,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 22:42:44,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:44,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:44,393 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) [2022-07-11 22:42:44,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-11 22:42:44,462 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 22:42:44,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:42:44,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 22:42:44,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-11 22:42:44,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-11 22:42:44,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:44,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104032113] [2022-07-11 22:42:44,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104032113] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:42:44,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:42:44,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-11 22:42:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030056560] [2022-07-11 22:42:44,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:42:44,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 22:42:44,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 22:42:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-11 22:42:44,715 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 22:42:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:44,902 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-07-11 22:42:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 22:42:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2022-07-11 22:42:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:44,904 INFO L225 Difference]: With dead ends: 64 [2022-07-11 22:42:44,904 INFO L226 Difference]: Without dead ends: 33 [2022-07-11 22:42:44,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-11 22:42:44,905 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:44,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 102 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 22:42:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-11 22:42:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-07-11 22:42:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-11 22:42:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-07-11 22:42:44,909 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 45 [2022-07-11 22:42:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:44,909 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-07-11 22:42:44,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 22:42:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-07-11 22:42:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 22:42:44,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:44,910 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:44,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:45,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:45,118 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash -457868326, now seen corresponding path program 5 times [2022-07-11 22:42:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:45,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229703063] [2022-07-11 22:42:45,119 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 22:42:45,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:45,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:45,124 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) [2022-07-11 22:42:45,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-11 22:42:45,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-11 22:42:45,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:42:45,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-11 22:42:45,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-11 22:42:45,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-11 22:42:45,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 22:42:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229703063] [2022-07-11 22:42:45,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229703063] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 22:42:45,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 22:42:45,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2022-07-11 22:42:45,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599203361] [2022-07-11 22:42:45,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 22:42:45,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 22:42:45,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 22:42:45,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 22:42:45,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-11 22:42:45,578 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 22:42:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 22:42:46,215 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-11 22:42:46,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-11 22:42:46,216 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2022-07-11 22:42:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 22:42:46,217 INFO L225 Difference]: With dead ends: 101 [2022-07-11 22:42:46,217 INFO L226 Difference]: Without dead ends: 82 [2022-07-11 22:42:46,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=763, Unknown=0, NotChecked=0, Total=992 [2022-07-11 22:42:46,218 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 85 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 22:42:46,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 190 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 22:42:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-11 22:42:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2022-07-11 22:42:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-11 22:42:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-07-11 22:42:46,224 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 49 [2022-07-11 22:42:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 22:42:46,224 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-07-11 22:42:46,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 22:42:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-07-11 22:42:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 22:42:46,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 22:42:46,225 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 22:42:46,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-11 22:42:46,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 22:42:46,434 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 22:42:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 22:42:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash -376141416, now seen corresponding path program 6 times [2022-07-11 22:42:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 22:42:46,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014331178] [2022-07-11 22:42:46,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 22:42:46,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 22:42:46,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 22:42:46,436 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) [2022-07-11 22:42:46,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-11 22:42:46,681 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-11 22:42:46,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 22:42:46,688 WARN L261 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-11 22:42:46,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 22:42:47,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:42:47,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 37 [2022-07-11 22:42:47,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 22:42:47,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 22:42:47,573 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-07-11 22:42:47,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 74 [2022-07-11 22:42:47,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:42:47,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 51 [2022-07-11 22:42:47,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 22:42:47,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 22:42:47,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:42:47,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 63 [2022-07-11 22:42:48,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 22:42:48,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 34 [2022-07-11 22:42:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-11 22:42:48,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 22:42:58,055 INFO L390 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 201 treesize of output 159 [2022-07-11 22:42:58,070 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-11 22:42:58,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7548080 treesize of output 4871344 [2022-07-11 22:46:15,130 WARN L233 SmtUtils]: Spent 3.28m on a formula simplification. DAG size of input: 376 DAG size of output: 376 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)