./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/locks/test_locks_5.c -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 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:39:44,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:39:44,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:39:44,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:39:44,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:39:44,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:39:44,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:39:44,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:39:44,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:39:44,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:39:44,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:39:44,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:39:44,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:39:44,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:39:44,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:39:44,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:39:44,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:39:44,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:39:44,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:39:44,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:39:44,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:39:44,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:39:44,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:39:44,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:39:44,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:39:44,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:39:44,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:39:44,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:39:44,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:39:44,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:39:44,800 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:39:44,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:39:44,802 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:39:44,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:39:44,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:39:44,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:39:44,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:39:44,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:39:44,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:39:44,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:39:44,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:39:44,807 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:39:44,833 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:39:44,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:39:44,834 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:39:44,834 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:39:44,835 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:39:44,835 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:39:44,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:39:44,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:39:44,836 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:39:44,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:39:44,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:39:44,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:39:44,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:39:44,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:39:44,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:39:44,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:39:44,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:39:44,838 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:39:44,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:39:44,838 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:39:44,838 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:39:44,838 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:39:44,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:39:44,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:39:44,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:44,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:39:44,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:39:44,840 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:39:44,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:39:44,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:39:44,841 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:39:44,841 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:39:44,841 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:39:44,841 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 -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 [2022-02-20 14:39:45,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:39:45,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:39:45,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:39:45,035 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:39:45,035 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:39:45,036 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2022-02-20 14:39:45,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733223b0b/b2cb6261609e400fbc797e239daa96d2/FLAGa73375e0b [2022-02-20 14:39:45,466 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:39:45,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2022-02-20 14:39:45,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733223b0b/b2cb6261609e400fbc797e239daa96d2/FLAGa73375e0b [2022-02-20 14:39:45,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733223b0b/b2cb6261609e400fbc797e239daa96d2 [2022-02-20 14:39:45,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:39:45,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:39:45,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:45,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:39:45,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:39:45,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b71d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45, skipping insertion in model container [2022-02-20 14:39:45,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:39:45,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:39:45,655 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/locks/test_locks_5.c[2207,2220] [2022-02-20 14:39:45,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:45,668 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:39:45,688 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/locks/test_locks_5.c[2207,2220] [2022-02-20 14:39:45,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:45,699 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:39:45,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45 WrapperNode [2022-02-20 14:39:45,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:45,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:45,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:39:45,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:39:45,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,724 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2022-02-20 14:39:45,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:45,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:39:45,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:39:45,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:39:45,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:39:45,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:39:45,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:39:45,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:39:45,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (1/1) ... [2022-02-20 14:39:45,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:45,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:39:45,765 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-02-20 14:39:45,767 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-02-20 14:39:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:39:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:39:45,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:39:45,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:39:45,828 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:39:45,829 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:39:46,004 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:39:46,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:39:46,008 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:39:46,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:46 BoogieIcfgContainer [2022-02-20 14:39:46,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:39:46,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:39:46,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:39:46,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:39:46,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:39:45" (1/3) ... [2022-02-20 14:39:46,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd39b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:46, skipping insertion in model container [2022-02-20 14:39:46,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:45" (2/3) ... [2022-02-20 14:39:46,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd39b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:46, skipping insertion in model container [2022-02-20 14:39:46,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:46" (3/3) ... [2022-02-20 14:39:46,018 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_5.c [2022-02-20 14:39:46,021 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:39:46,021 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:39:46,049 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:39:46,064 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:39:46,066 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:39:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:39:46,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:46,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:46,089 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash -161811697, now seen corresponding path program 1 times [2022-02-20 14:39:46,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:46,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982959217] [2022-02-20 14:39:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:46,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:46,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-02-20 14:39:46,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {28#true} is VALID [2022-02-20 14:39:46,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {28#true} is VALID [2022-02-20 14:39:46,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {28#true} is VALID [2022-02-20 14:39:46,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:46,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:46,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:46,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:46,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:46,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:46,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {29#false} is VALID [2022-02-20 14:39:46,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 14:39:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:46,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:46,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982959217] [2022-02-20 14:39:46,312 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982959217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:46,312 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:46,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:46,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632114393] [2022-02-20 14:39:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:39:46,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:46,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:46,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:46,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:46,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:46,378 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.826086956521739) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,484 INFO L93 Difference]: Finished difference Result 53 states and 85 transitions. [2022-02-20 14:39:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:39:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-02-20 14:39:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-02-20 14:39:46,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2022-02-20 14:39:46,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:46,564 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:39:46,564 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 14:39:46,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:46,569 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:46,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 14:39:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2022-02-20 14:39:46,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:46,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,589 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,590 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,592 INFO L93 Difference]: Finished difference Result 39 states and 65 transitions. [2022-02-20 14:39:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 65 transitions. [2022-02-20 14:39:46,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:46,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:46,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 14:39:46,594 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 14:39:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,597 INFO L93 Difference]: Finished difference Result 39 states and 65 transitions. [2022-02-20 14:39:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 65 transitions. [2022-02-20 14:39:46,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:46,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:46,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:46,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2022-02-20 14:39:46,600 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 12 [2022-02-20 14:39:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:46,601 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 46 transitions. [2022-02-20 14:39:46,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 46 transitions. [2022-02-20 14:39:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:39:46,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:46,602 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:46,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:39:46,602 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash -971158323, now seen corresponding path program 1 times [2022-02-20 14:39:46,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:46,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489567462] [2022-02-20 14:39:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:46,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-02-20 14:39:46,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {204#true} is VALID [2022-02-20 14:39:46,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {204#true} is VALID [2022-02-20 14:39:46,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {204#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {204#true} is VALID [2022-02-20 14:39:46,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {204#true} assume !(0 != main_~p1~0#1); {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:46,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:46,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:46,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:46,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:46,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {205#false} is VALID [2022-02-20 14:39:46,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {205#false} assume 1 != main_~lk1~0#1; {205#false} is VALID [2022-02-20 14:39:46,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-02-20 14:39:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:46,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:46,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489567462] [2022-02-20 14:39:46,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489567462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:46,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:46,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:46,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465465868] [2022-02-20 14:39:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:39:46,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:46,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:46,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:46,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:46,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:46,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:46,679 INFO L87 Difference]: Start difference. First operand 27 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,728 INFO L93 Difference]: Finished difference Result 64 states and 109 transitions. [2022-02-20 14:39:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:39:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-20 14:39:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-20 14:39:46,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 98 transitions. [2022-02-20 14:39:46,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:46,786 INFO L225 Difference]: With dead ends: 64 [2022-02-20 14:39:46,786 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 14:39:46,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:46,793 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:46,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 14:39:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-02-20 14:39:46,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:46,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,803 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,804 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,821 INFO L93 Difference]: Finished difference Result 39 states and 63 transitions. [2022-02-20 14:39:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2022-02-20 14:39:46,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:46,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:46,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 14:39:46,822 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 14:39:46,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,824 INFO L93 Difference]: Finished difference Result 39 states and 63 transitions. [2022-02-20 14:39:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2022-02-20 14:39:46,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:46,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:46,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:46,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 36 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 62 transitions. [2022-02-20 14:39:46,828 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 62 transitions. Word has length 12 [2022-02-20 14:39:46,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:46,828 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 62 transitions. [2022-02-20 14:39:46,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 62 transitions. [2022-02-20 14:39:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:39:46,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:46,828 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:46,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:39:46,829 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:46,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:46,829 INFO L85 PathProgramCache]: Analyzing trace with hash -720980343, now seen corresponding path program 1 times [2022-02-20 14:39:46,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:46,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836673193] [2022-02-20 14:39:46,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:46,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {397#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {397#true} is VALID [2022-02-20 14:39:46,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {397#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {397#true} is VALID [2022-02-20 14:39:46,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {397#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {397#true} is VALID [2022-02-20 14:39:46,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {397#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {397#true} is VALID [2022-02-20 14:39:46,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {397#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:46,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:46,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:46,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:46,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:46,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {399#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {398#false} is VALID [2022-02-20 14:39:46,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {398#false} assume 0 != main_~p2~0#1; {398#false} is VALID [2022-02-20 14:39:46,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {398#false} assume 1 != main_~lk2~0#1; {398#false} is VALID [2022-02-20 14:39:46,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {398#false} assume !false; {398#false} is VALID [2022-02-20 14:39:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:46,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:46,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836673193] [2022-02-20 14:39:46,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836673193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:46,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:46,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:46,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21543271] [2022-02-20 14:39:46,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:39:46,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:46,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:46,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:46,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:46,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:46,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:46,887 INFO L87 Difference]: Start difference. First operand 37 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,946 INFO L93 Difference]: Finished difference Result 60 states and 96 transitions. [2022-02-20 14:39:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:46,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:39:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-02-20 14:39:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-02-20 14:39:46,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-02-20 14:39:47,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,029 INFO L225 Difference]: With dead ends: 60 [2022-02-20 14:39:47,029 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 14:39:47,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,030 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:47,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 14:39:47,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-02-20 14:39:47,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:47,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,033 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,033 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,034 INFO L93 Difference]: Finished difference Result 42 states and 65 transitions. [2022-02-20 14:39:47,035 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2022-02-20 14:39:47,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:39:47,035 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 42 states. [2022-02-20 14:39:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,037 INFO L93 Difference]: Finished difference Result 42 states and 65 transitions. [2022-02-20 14:39:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2022-02-20 14:39:47,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:47,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 64 transitions. [2022-02-20 14:39:47,039 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 64 transitions. Word has length 13 [2022-02-20 14:39:47,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:47,039 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 64 transitions. [2022-02-20 14:39:47,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions. [2022-02-20 14:39:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:39:47,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:47,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:47,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:39:47,040 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash -40921973, now seen corresponding path program 1 times [2022-02-20 14:39:47,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:47,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889483147] [2022-02-20 14:39:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:47,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {597#true} is VALID [2022-02-20 14:39:47,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {597#true} is VALID [2022-02-20 14:39:47,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {597#true} is VALID [2022-02-20 14:39:47,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {597#true} is VALID [2022-02-20 14:39:47,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {597#true} assume !(0 != main_~p1~0#1); {597#true} is VALID [2022-02-20 14:39:47,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:47,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:47,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:47,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:47,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:47,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:47,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {598#false} is VALID [2022-02-20 14:39:47,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-02-20 14:39:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:47,070 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:47,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889483147] [2022-02-20 14:39:47,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889483147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:47,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:47,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:47,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514348471] [2022-02-20 14:39:47,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:47,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:39:47,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:47,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:47,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:47,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:47,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,083 INFO L87 Difference]: Start difference. First operand 40 states and 64 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,122 INFO L93 Difference]: Finished difference Result 73 states and 117 transitions. [2022-02-20 14:39:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:39:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 14:39:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 14:39:47,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-02-20 14:39:47,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,167 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:39:47,167 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 14:39:47,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,175 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:47,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 14:39:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2022-02-20 14:39:47,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:47,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,186 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,186 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,188 INFO L93 Difference]: Finished difference Result 71 states and 114 transitions. [2022-02-20 14:39:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 114 transitions. [2022-02-20 14:39:47,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 71 states. [2022-02-20 14:39:47,188 INFO L87 Difference]: Start difference. First operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 71 states. [2022-02-20 14:39:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,190 INFO L93 Difference]: Finished difference Result 71 states and 114 transitions. [2022-02-20 14:39:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 114 transitions. [2022-02-20 14:39:47,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:47,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 85 transitions. [2022-02-20 14:39:47,192 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 85 transitions. Word has length 13 [2022-02-20 14:39:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:47,192 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 85 transitions. [2022-02-20 14:39:47,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 85 transitions. [2022-02-20 14:39:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:39:47,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:47,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:47,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:39:47,193 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:47,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash -850268599, now seen corresponding path program 1 times [2022-02-20 14:39:47,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:47,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901876522] [2022-02-20 14:39:47,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:47,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {882#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {882#true} is VALID [2022-02-20 14:39:47,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {882#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {882#true} is VALID [2022-02-20 14:39:47,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {882#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {882#true} is VALID [2022-02-20 14:39:47,225 INFO L290 TraceCheckUtils]: 3: Hoare triple {882#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {882#true} is VALID [2022-02-20 14:39:47,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {882#true} assume !(0 != main_~p1~0#1); {882#true} is VALID [2022-02-20 14:39:47,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {882#true} assume !(0 != main_~p2~0#1); {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:47,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:47,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:47,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:47,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:47,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {883#false} is VALID [2022-02-20 14:39:47,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {883#false} assume 1 != main_~lk2~0#1; {883#false} is VALID [2022-02-20 14:39:47,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {883#false} assume !false; {883#false} is VALID [2022-02-20 14:39:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:47,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:47,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901876522] [2022-02-20 14:39:47,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901876522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:47,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:47,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:47,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107436923] [2022-02-20 14:39:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:47,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:39:47,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:47,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:47,236 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:47,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:47,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,237 INFO L87 Difference]: Start difference. First operand 53 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,272 INFO L93 Difference]: Finished difference Result 121 states and 195 transitions. [2022-02-20 14:39:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:47,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:39:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 14:39:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 14:39:47,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-02-20 14:39:47,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,334 INFO L225 Difference]: With dead ends: 121 [2022-02-20 14:39:47,334 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 14:39:47,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,335 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:47,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 14:39:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-02-20 14:39:47,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:47,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,339 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,339 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,341 INFO L93 Difference]: Finished difference Result 73 states and 112 transitions. [2022-02-20 14:39:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2022-02-20 14:39:47,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 73 states. [2022-02-20 14:39:47,343 INFO L87 Difference]: Start difference. First operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 73 states. [2022-02-20 14:39:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,345 INFO L93 Difference]: Finished difference Result 73 states and 112 transitions. [2022-02-20 14:39:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2022-02-20 14:39:47,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:47,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 70 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 111 transitions. [2022-02-20 14:39:47,351 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 111 transitions. Word has length 13 [2022-02-20 14:39:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:47,351 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 111 transitions. [2022-02-20 14:39:47,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 111 transitions. [2022-02-20 14:39:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:39:47,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:47,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:47,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:39:47,352 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1268365854, now seen corresponding path program 1 times [2022-02-20 14:39:47,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:47,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216474254] [2022-02-20 14:39:47,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:47,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {1241#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1241#true} is VALID [2022-02-20 14:39:47,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {1241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {1241#true} is VALID [2022-02-20 14:39:47,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1241#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1241#true} is VALID [2022-02-20 14:39:47,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {1241#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {1241#true} is VALID [2022-02-20 14:39:47,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {1241#true} assume !(0 != main_~p1~0#1); {1241#true} is VALID [2022-02-20 14:39:47,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {1241#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:47,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:47,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:47,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:47,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:47,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {1242#false} is VALID [2022-02-20 14:39:47,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {1242#false} assume 0 != main_~p3~0#1; {1242#false} is VALID [2022-02-20 14:39:47,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {1242#false} assume 1 != main_~lk3~0#1; {1242#false} is VALID [2022-02-20 14:39:47,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {1242#false} assume !false; {1242#false} is VALID [2022-02-20 14:39:47,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:47,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:47,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216474254] [2022-02-20 14:39:47,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216474254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:47,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:47,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:47,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985915937] [2022-02-20 14:39:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:47,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:47,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:47,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:47,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:47,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:47,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,415 INFO L87 Difference]: Start difference. First operand 71 states and 111 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,457 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2022-02-20 14:39:47,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:47,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-02-20 14:39:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-02-20 14:39:47,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-02-20 14:39:47,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,520 INFO L225 Difference]: With dead ends: 108 [2022-02-20 14:39:47,520 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:39:47,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,521 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:47,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:39:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-02-20 14:39:47,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:47,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,533 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,533 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,535 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2022-02-20 14:39:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2022-02-20 14:39:47,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 14:39:47,535 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 14:39:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,537 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2022-02-20 14:39:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2022-02-20 14:39:47,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:47,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 72 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2022-02-20 14:39:47,538 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 14 [2022-02-20 14:39:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:47,539 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2022-02-20 14:39:47,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2022-02-20 14:39:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:39:47,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:47,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:47,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:39:47,539 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -588307484, now seen corresponding path program 1 times [2022-02-20 14:39:47,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:47,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078370123] [2022-02-20 14:39:47,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:47,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {1593#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1593#true} is VALID [2022-02-20 14:39:47,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {1593#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {1593#true} is VALID [2022-02-20 14:39:47,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {1593#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {1593#true} is VALID [2022-02-20 14:39:47,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {1593#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {1593#true} is VALID [2022-02-20 14:39:47,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {1593#true} assume !(0 != main_~p1~0#1); {1593#true} is VALID [2022-02-20 14:39:47,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {1593#true} assume !(0 != main_~p2~0#1); {1593#true} is VALID [2022-02-20 14:39:47,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {1593#true} assume !(0 != main_~p3~0#1); {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:47,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:47,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:47,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:47,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:47,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {1595#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {1594#false} is VALID [2022-02-20 14:39:47,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {1594#false} assume 1 != main_~lk3~0#1; {1594#false} is VALID [2022-02-20 14:39:47,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {1594#false} assume !false; {1594#false} is VALID [2022-02-20 14:39:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:47,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:47,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078370123] [2022-02-20 14:39:47,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078370123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:47,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:47,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:47,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572268988] [2022-02-20 14:39:47,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:47,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:47,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:47,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:47,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:47,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,608 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,646 INFO L93 Difference]: Finished difference Result 201 states and 305 transitions. [2022-02-20 14:39:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-02-20 14:39:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-02-20 14:39:47,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-02-20 14:39:47,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,696 INFO L225 Difference]: With dead ends: 201 [2022-02-20 14:39:47,696 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 14:39:47,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,697 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:47,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 14:39:47,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-02-20 14:39:47,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:47,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,701 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,701 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,704 INFO L93 Difference]: Finished difference Result 135 states and 196 transitions. [2022-02-20 14:39:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2022-02-20 14:39:47,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 135 states. [2022-02-20 14:39:47,704 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 135 states. [2022-02-20 14:39:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,707 INFO L93 Difference]: Finished difference Result 135 states and 196 transitions. [2022-02-20 14:39:47,707 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2022-02-20 14:39:47,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:47,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.4772727272727273) internal successors, (195), 132 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 195 transitions. [2022-02-20 14:39:47,710 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 195 transitions. Word has length 14 [2022-02-20 14:39:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:47,710 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 195 transitions. [2022-02-20 14:39:47,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 195 transitions. [2022-02-20 14:39:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:39:47,711 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:47,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:47,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:39:47,711 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:47,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:47,711 INFO L85 PathProgramCache]: Analyzing trace with hash 221039142, now seen corresponding path program 1 times [2022-02-20 14:39:47,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:47,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777334320] [2022-02-20 14:39:47,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:47,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {2228#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2228#true} is VALID [2022-02-20 14:39:47,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {2228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {2228#true} is VALID [2022-02-20 14:39:47,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {2228#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2228#true} is VALID [2022-02-20 14:39:47,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {2228#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {2228#true} is VALID [2022-02-20 14:39:47,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {2228#true} assume !(0 != main_~p1~0#1); {2228#true} is VALID [2022-02-20 14:39:47,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {2228#true} assume !(0 != main_~p2~0#1); {2228#true} is VALID [2022-02-20 14:39:47,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {2228#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:47,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:47,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:47,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:47,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:47,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:47,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {2230#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {2229#false} is VALID [2022-02-20 14:39:47,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {2229#false} assume !false; {2229#false} is VALID [2022-02-20 14:39:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:47,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:47,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777334320] [2022-02-20 14:39:47,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777334320] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:47,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:47,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:47,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14784071] [2022-02-20 14:39:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:47,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:47,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:47,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:47,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:47,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:47,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,761 INFO L87 Difference]: Start difference. First operand 133 states and 195 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,806 INFO L93 Difference]: Finished difference Result 161 states and 237 transitions. [2022-02-20 14:39:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:47,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-02-20 14:39:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-02-20 14:39:47,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-02-20 14:39:47,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,845 INFO L225 Difference]: With dead ends: 161 [2022-02-20 14:39:47,845 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 14:39:47,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,846 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:47,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:47,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 14:39:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2022-02-20 14:39:47,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:47,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,850 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,850 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,857 INFO L93 Difference]: Finished difference Result 159 states and 232 transitions. [2022-02-20 14:39:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 232 transitions. [2022-02-20 14:39:47,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 159 states. [2022-02-20 14:39:47,865 INFO L87 Difference]: Start difference. First operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 159 states. [2022-02-20 14:39:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,868 INFO L93 Difference]: Finished difference Result 159 states and 232 transitions. [2022-02-20 14:39:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 232 transitions. [2022-02-20 14:39:47,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:47,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.446969696969697) internal successors, (191), 132 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2022-02-20 14:39:47,871 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 14 [2022-02-20 14:39:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:47,872 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2022-02-20 14:39:47,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2022-02-20 14:39:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:47,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:47,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:47,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:39:47,873 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:47,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:47,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1057447170, now seen corresponding path program 1 times [2022-02-20 14:39:47,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:47,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287850758] [2022-02-20 14:39:47,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:47,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {2871#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2871#true} is VALID [2022-02-20 14:39:47,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2871#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {2871#true} is VALID [2022-02-20 14:39:47,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2871#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {2871#true} is VALID [2022-02-20 14:39:47,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {2871#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {2871#true} is VALID [2022-02-20 14:39:47,901 INFO L290 TraceCheckUtils]: 4: Hoare triple {2871#true} assume !(0 != main_~p1~0#1); {2871#true} is VALID [2022-02-20 14:39:47,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {2871#true} assume !(0 != main_~p2~0#1); {2871#true} is VALID [2022-02-20 14:39:47,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {2871#true} assume !(0 != main_~p3~0#1); {2871#true} is VALID [2022-02-20 14:39:47,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {2871#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:47,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:47,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:47,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:47,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:47,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:47,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {2873#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {2872#false} is VALID [2022-02-20 14:39:47,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {2872#false} assume !false; {2872#false} is VALID [2022-02-20 14:39:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:47,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:47,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287850758] [2022-02-20 14:39:47,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287850758] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:47,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:47,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:47,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129651873] [2022-02-20 14:39:47,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:47,905 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:47,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:47,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:47,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:47,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:47,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,914 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,946 INFO L93 Difference]: Finished difference Result 229 states and 329 transitions. [2022-02-20 14:39:47,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:47,946 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:47,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 14:39:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 14:39:47,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-02-20 14:39:47,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,984 INFO L225 Difference]: With dead ends: 229 [2022-02-20 14:39:47,984 INFO L226 Difference]: Without dead ends: 227 [2022-02-20 14:39:47,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,985 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:47,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-02-20 14:39:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 193. [2022-02-20 14:39:47,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:47,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,990 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,990 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,994 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2022-02-20 14:39:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 320 transitions. [2022-02-20 14:39:47,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 227 states. [2022-02-20 14:39:47,995 INFO L87 Difference]: Start difference. First operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 227 states. [2022-02-20 14:39:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,999 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2022-02-20 14:39:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 320 transitions. [2022-02-20 14:39:48,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:48,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.4114583333333333) internal successors, (271), 192 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 271 transitions. [2022-02-20 14:39:48,003 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 271 transitions. Word has length 15 [2022-02-20 14:39:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:48,003 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 271 transitions. [2022-02-20 14:39:48,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 271 transitions. [2022-02-20 14:39:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:48,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:48,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:48,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:39:48,004 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:48,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1866793796, now seen corresponding path program 1 times [2022-02-20 14:39:48,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:48,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217634709] [2022-02-20 14:39:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:48,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:48,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {3782#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3782#true} is VALID [2022-02-20 14:39:48,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {3782#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {3782#true} is VALID [2022-02-20 14:39:48,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {3782#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {3782#true} is VALID [2022-02-20 14:39:48,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {3782#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {3782#true} is VALID [2022-02-20 14:39:48,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {3782#true} assume !(0 != main_~p1~0#1); {3782#true} is VALID [2022-02-20 14:39:48,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {3782#true} assume !(0 != main_~p2~0#1); {3782#true} is VALID [2022-02-20 14:39:48,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {3782#true} assume !(0 != main_~p3~0#1); {3782#true} is VALID [2022-02-20 14:39:48,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {3782#true} assume !(0 != main_~p4~0#1); {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:48,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:48,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:48,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:48,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:48,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {3784#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {3783#false} is VALID [2022-02-20 14:39:48,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {3783#false} assume 1 != main_~lk4~0#1; {3783#false} is VALID [2022-02-20 14:39:48,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {3783#false} assume !false; {3783#false} is VALID [2022-02-20 14:39:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:48,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:48,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217634709] [2022-02-20 14:39:48,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217634709] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:48,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:48,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:48,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456194773] [2022-02-20 14:39:48,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:48,047 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:48,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:48,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:48,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:48,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:48,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:48,056 INFO L87 Difference]: Start difference. First operand 193 states and 271 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,095 INFO L93 Difference]: Finished difference Result 437 states and 609 transitions. [2022-02-20 14:39:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:48,096 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-02-20 14:39:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-02-20 14:39:48,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2022-02-20 14:39:48,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,142 INFO L225 Difference]: With dead ends: 437 [2022-02-20 14:39:48,142 INFO L226 Difference]: Without dead ends: 251 [2022-02-20 14:39:48,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:48,143 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:48,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-20 14:39:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2022-02-20 14:39:48,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:48,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 249 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 248 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,149 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 249 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 248 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,149 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 249 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 248 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,153 INFO L93 Difference]: Finished difference Result 251 states and 332 transitions. [2022-02-20 14:39:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2022-02-20 14:39:48,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 248 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 251 states. [2022-02-20 14:39:48,154 INFO L87 Difference]: Start difference. First operand has 249 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 248 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 251 states. [2022-02-20 14:39:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,158 INFO L93 Difference]: Finished difference Result 251 states and 332 transitions. [2022-02-20 14:39:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 332 transitions. [2022-02-20 14:39:48,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:48,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.3346774193548387) internal successors, (331), 248 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 331 transitions. [2022-02-20 14:39:48,162 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 331 transitions. Word has length 15 [2022-02-20 14:39:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:48,162 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 331 transitions. [2022-02-20 14:39:48,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 331 transitions. [2022-02-20 14:39:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:48,163 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:48,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:48,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:39:48,163 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1579092089, now seen corresponding path program 1 times [2022-02-20 14:39:48,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:48,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303946019] [2022-02-20 14:39:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:48,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {5021#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5021#true} is VALID [2022-02-20 14:39:48,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {5021#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {5021#true} is VALID [2022-02-20 14:39:48,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {5021#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {5021#true} is VALID [2022-02-20 14:39:48,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {5021#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {5021#true} is VALID [2022-02-20 14:39:48,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {5021#true} assume !(0 != main_~p1~0#1); {5021#true} is VALID [2022-02-20 14:39:48,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {5021#true} assume !(0 != main_~p2~0#1); {5021#true} is VALID [2022-02-20 14:39:48,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {5021#true} assume !(0 != main_~p3~0#1); {5021#true} is VALID [2022-02-20 14:39:48,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {5021#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:48,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:48,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:48,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:48,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:48,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {5023#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {5022#false} is VALID [2022-02-20 14:39:48,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {5022#false} assume 0 != main_~p5~0#1; {5022#false} is VALID [2022-02-20 14:39:48,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {5022#false} assume 1 != main_~lk5~0#1; {5022#false} is VALID [2022-02-20 14:39:48,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {5022#false} assume !false; {5022#false} is VALID [2022-02-20 14:39:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:48,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:48,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303946019] [2022-02-20 14:39:48,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303946019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:48,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:48,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:48,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949956393] [2022-02-20 14:39:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:48,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:48,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:48,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:48,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:48,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:48,197 INFO L87 Difference]: Start difference. First operand 249 states and 331 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,231 INFO L93 Difference]: Finished difference Result 381 states and 505 transitions. [2022-02-20 14:39:48,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:48,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-02-20 14:39:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-02-20 14:39:48,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-02-20 14:39:48,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,274 INFO L225 Difference]: With dead ends: 381 [2022-02-20 14:39:48,274 INFO L226 Difference]: Without dead ends: 263 [2022-02-20 14:39:48,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:48,275 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:48,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-02-20 14:39:48,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-02-20 14:39:48,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:48,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 261 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,281 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 261 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,281 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 261 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,285 INFO L93 Difference]: Finished difference Result 263 states and 340 transitions. [2022-02-20 14:39:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 340 transitions. [2022-02-20 14:39:48,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 263 states. [2022-02-20 14:39:48,286 INFO L87 Difference]: Start difference. First operand has 261 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 263 states. [2022-02-20 14:39:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,290 INFO L93 Difference]: Finished difference Result 263 states and 340 transitions. [2022-02-20 14:39:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 340 transitions. [2022-02-20 14:39:48,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:48,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions. [2022-02-20 14:39:48,295 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 16 [2022-02-20 14:39:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:48,295 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 339 transitions. [2022-02-20 14:39:48,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions. [2022-02-20 14:39:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:48,296 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:48,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:48,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:39:48,296 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2035816837, now seen corresponding path program 1 times [2022-02-20 14:39:48,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:48,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394920600] [2022-02-20 14:39:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:48,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {6240#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6240#true} is VALID [2022-02-20 14:39:48,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {6240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {6240#true} is VALID [2022-02-20 14:39:48,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {6240#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {6240#true} is VALID [2022-02-20 14:39:48,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {6240#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {6240#true} is VALID [2022-02-20 14:39:48,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {6240#true} assume !(0 != main_~p1~0#1); {6240#true} is VALID [2022-02-20 14:39:48,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {6240#true} assume !(0 != main_~p2~0#1); {6240#true} is VALID [2022-02-20 14:39:48,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {6240#true} assume !(0 != main_~p3~0#1); {6240#true} is VALID [2022-02-20 14:39:48,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {6240#true} assume !(0 != main_~p4~0#1); {6240#true} is VALID [2022-02-20 14:39:48,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {6240#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:48,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:48,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:48,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:48,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:48,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:48,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {6242#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {6241#false} is VALID [2022-02-20 14:39:48,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {6241#false} assume !false; {6241#false} is VALID [2022-02-20 14:39:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:48,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:48,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394920600] [2022-02-20 14:39:48,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394920600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:48,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:48,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:48,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189797974] [2022-02-20 14:39:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:48,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:48,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:48,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:48,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:48,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:48,335 INFO L87 Difference]: Start difference. First operand 261 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,371 INFO L93 Difference]: Finished difference Result 423 states and 540 transitions. [2022-02-20 14:39:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:48,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 14:39:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-02-20 14:39:48,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-02-20 14:39:48,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,403 INFO L225 Difference]: With dead ends: 423 [2022-02-20 14:39:48,403 INFO L226 Difference]: Without dead ends: 421 [2022-02-20 14:39:48,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:48,404 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:48,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 58 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2022-02-20 14:39:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 389. [2022-02-20 14:39:48,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:48,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 421 states. Second operand has 389 states, 388 states have (on average 1.2654639175257731) internal successors, (491), 388 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,412 INFO L74 IsIncluded]: Start isIncluded. First operand 421 states. Second operand has 389 states, 388 states have (on average 1.2654639175257731) internal successors, (491), 388 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,412 INFO L87 Difference]: Start difference. First operand 421 states. Second operand has 389 states, 388 states have (on average 1.2654639175257731) internal successors, (491), 388 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,421 INFO L93 Difference]: Finished difference Result 421 states and 523 transitions. [2022-02-20 14:39:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 523 transitions. [2022-02-20 14:39:48,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 388 states have (on average 1.2654639175257731) internal successors, (491), 388 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 421 states. [2022-02-20 14:39:48,424 INFO L87 Difference]: Start difference. First operand has 389 states, 388 states have (on average 1.2654639175257731) internal successors, (491), 388 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 421 states. [2022-02-20 14:39:48,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,434 INFO L93 Difference]: Finished difference Result 421 states and 523 transitions. [2022-02-20 14:39:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 523 transitions. [2022-02-20 14:39:48,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:48,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 1.2654639175257731) internal successors, (491), 388 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 491 transitions. [2022-02-20 14:39:48,443 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 491 transitions. Word has length 16 [2022-02-20 14:39:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:48,444 INFO L470 AbstractCegarLoop]: Abstraction has 389 states and 491 transitions. [2022-02-20 14:39:48,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 491 transitions. [2022-02-20 14:39:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:48,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:48,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:48,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:39:48,445 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:48,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1449803833, now seen corresponding path program 1 times [2022-02-20 14:39:48,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:48,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47405222] [2022-02-20 14:39:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:48,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {7952#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7952#true} is VALID [2022-02-20 14:39:48,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {7952#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; {7952#true} is VALID [2022-02-20 14:39:48,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {7952#true} assume !false;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {7952#true} is VALID [2022-02-20 14:39:48,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {7952#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; {7952#true} is VALID [2022-02-20 14:39:48,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {7952#true} assume !(0 != main_~p1~0#1); {7952#true} is VALID [2022-02-20 14:39:48,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {7952#true} assume !(0 != main_~p2~0#1); {7952#true} is VALID [2022-02-20 14:39:48,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {7952#true} assume !(0 != main_~p3~0#1); {7952#true} is VALID [2022-02-20 14:39:48,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {7952#true} assume !(0 != main_~p4~0#1); {7952#true} is VALID [2022-02-20 14:39:48,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {7952#true} assume !(0 != main_~p5~0#1); {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:48,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:48,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:48,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:48,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:48,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {7954#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {7953#false} is VALID [2022-02-20 14:39:48,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {7953#false} assume 1 != main_~lk5~0#1; {7953#false} is VALID [2022-02-20 14:39:48,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {7953#false} assume !false; {7953#false} is VALID [2022-02-20 14:39:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:48,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:48,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47405222] [2022-02-20 14:39:48,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47405222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:48,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:48,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:48,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997597806] [2022-02-20 14:39:48,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:48,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:48,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:48,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:48,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:48,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:48,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:48,482 INFO L87 Difference]: Start difference. First operand 389 states and 491 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,540 INFO L93 Difference]: Finished difference Result 853 states and 1051 transitions. [2022-02-20 14:39:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:48,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-02-20 14:39:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-02-20 14:39:48,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-02-20 14:39:48,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,584 INFO L225 Difference]: With dead ends: 853 [2022-02-20 14:39:48,584 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:39:48,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:48,586 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:48,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:39:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:39:48,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:48,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,586 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,587 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,587 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:39:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:48,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:39:48,587 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:39:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,587 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:39:48,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:48,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:48,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:39:48,588 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 14:39:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:48,588 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:39:48,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:48,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,590 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:39:48,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 14:39:48,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:39:48,601 INFO L861 garLoopResultBuilder]: At program point L85-1(lines 26 90) the Hoare annotation is: true [2022-02-20 14:39:48,601 INFO L858 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-02-20 14:39:48,601 INFO L858 garLoopResultBuilder]: For program point L65-1(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,601 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:39:48,601 INFO L861 garLoopResultBuilder]: At program point L94(lines 6 95) the Hoare annotation is: true [2022-02-20 14:39:48,601 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:39:48,601 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:39:48,601 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 30) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L854 garLoopResultBuilder]: At program point L86-1(lines 7 95) the Hoare annotation is: false [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L861 garLoopResultBuilder]: At program point L91(lines 7 95) the Hoare annotation is: true [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L55-1(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L51-1(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L80-1(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L47-1(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-02-20 14:39:48,602 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 26 90) no Hoare annotation was computed. [2022-02-20 14:39:48,605 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:48,606 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:39:48,608 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:39:48,608 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:39:48,608 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 14:39:48,608 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 14:39:48,608 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 14:39:48,608 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 14:39:48,609 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 14:39:48,610 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 14:39:48,610 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:39:48,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:39:48 BoogieIcfgContainer [2022-02-20 14:39:48,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:39:48,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:39:48,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:39:48,615 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:39:48,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:46" (3/4) ... [2022-02-20 14:39:48,617 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:39:48,624 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 14:39:48,624 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 14:39:48,624 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:39:48,625 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:39:48,646 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:39:48,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:39:48,647 INFO L158 Benchmark]: Toolchain (without parser) took 3157.51ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 65.3MB in the beginning and 48.4MB in the end (delta: 16.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-02-20 14:39:48,647 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:39:48,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.38ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 73.1MB in the end (delta: -8.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 14:39:48,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.23ms. Allocated memory is still 98.6MB. Free memory was 73.1MB in the beginning and 71.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:39:48,647 INFO L158 Benchmark]: Boogie Preprocessor took 14.50ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 70.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:39:48,648 INFO L158 Benchmark]: RCFGBuilder took 269.94ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 58.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:39:48,648 INFO L158 Benchmark]: TraceAbstraction took 2603.79ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 57.5MB in the beginning and 51.5MB in the end (delta: 6.0MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2022-02-20 14:39:48,648 INFO L158 Benchmark]: Witness Printer took 31.54ms. Allocated memory is still 123.7MB. Free memory was 51.5MB in the beginning and 48.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 14:39:48,649 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory is still 52.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.38ms. Allocated memory is still 98.6MB. Free memory was 65.1MB in the beginning and 73.1MB in the end (delta: -8.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.23ms. Allocated memory is still 98.6MB. Free memory was 73.1MB in the beginning and 71.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.50ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 70.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 269.94ms. Allocated memory is still 98.6MB. Free memory was 70.1MB in the beginning and 58.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2603.79ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 57.5MB in the beginning and 51.5MB in the end (delta: 6.0MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Witness Printer took 31.54ms. Allocated memory is still 123.7MB. Free memory was 51.5MB in the beginning and 48.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 93]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 264 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 932 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 574 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=12, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 41 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 14:39:48,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE