./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_8.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_8.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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:39:53,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:39:53,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:39:53,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:39:53,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:39:53,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:39:53,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:39:53,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:39:53,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:39:53,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:39:53,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:39:53,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:39:53,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:39:53,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:39:53,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:39:53,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:39:53,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:39:53,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:39:53,658 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:39:53,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:39:53,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:39:53,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:39:53,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:39:53,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:39:53,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:39:53,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:39:53,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:39:53,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:39:53,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:39:53,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:39:53,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:39:53,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:39:53,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:39:53,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:39:53,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:39:53,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:39:53,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:39:53,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:39:53,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:39:53,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:39:53,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:39:53,672 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:53,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:39:53,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:39:53,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:39:53,695 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:39:53,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:39:53,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:39:53,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:39:53,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:39:53,697 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:39:53,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:39:53,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:39:53,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:39:53,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:39:53,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:39:53,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:39:53,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:39:53,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:39:53,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:39:53,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:39:53,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:39:53,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:39:53,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:39:53,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:39:53,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:39:53,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:53,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:39:53,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:39:53,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:39:53,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:39:53,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:39:53,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:39:53,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:39:53,702 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:39:53,702 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2022-02-20 14:39:53,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:39:53,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:39:53,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:39:53,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:39:53,917 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:39:53,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_8.c [2022-02-20 14:39:53,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a876322f/57a9eee9eeb14c089173776ce5a0835c/FLAG07df074e6 [2022-02-20 14:39:54,323 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:39:54,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_8.c [2022-02-20 14:39:54,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a876322f/57a9eee9eeb14c089173776ce5a0835c/FLAG07df074e6 [2022-02-20 14:39:54,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a876322f/57a9eee9eeb14c089173776ce5a0835c [2022-02-20 14:39:54,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:39:54,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:39:54,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:54,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:39:54,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:39:54,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:54" (1/1) ... [2022-02-20 14:39:54,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7badd8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:54, skipping insertion in model container [2022-02-20 14:39:54,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:54" (1/1) ... [2022-02-20 14:39:54,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:39:54,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:39:54,524 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_8.c[3218,3231] [2022-02-20 14:39:54,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:54,543 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:39:54,558 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_8.c[3218,3231] [2022-02-20 14:39:54,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:54,571 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:39:54,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:54 WrapperNode [2022-02-20 14:39:54,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:54,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:54,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:39:54,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:39:54,578 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:54" (1/1) ... [2022-02-20 14:39:54,583 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:54" (1/1) ... [2022-02-20 14:39:54,613 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-02-20 14:39:54,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:54,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:39:54,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:39:54,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:39:54,620 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:54" (1/1) ... [2022-02-20 14:39:54,620 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:54" (1/1) ... [2022-02-20 14:39:54,629 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:54" (1/1) ... [2022-02-20 14:39:54,630 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:54" (1/1) ... [2022-02-20 14:39:54,633 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:54" (1/1) ... [2022-02-20 14:39:54,637 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:54" (1/1) ... [2022-02-20 14:39:54,638 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:54" (1/1) ... [2022-02-20 14:39:54,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:39:54,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:39:54,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:39:54,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:39:54,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:54" (1/1) ... [2022-02-20 14:39:54,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:54,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:39:54,669 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:54,671 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:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:39:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:39:54,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:39:54,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:39:54,753 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:39:54,754 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:39:54,955 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:39:54,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:39:54,971 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:39:54,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:54 BoogieIcfgContainer [2022-02-20 14:39:54,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:39:54,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:39:54,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:39:54,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:39:54,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:39:54" (1/3) ... [2022-02-20 14:39:54,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b3826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:54, skipping insertion in model container [2022-02-20 14:39:54,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:54" (2/3) ... [2022-02-20 14:39:54,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b3826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:54, skipping insertion in model container [2022-02-20 14:39:54,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:54" (3/3) ... [2022-02-20 14:39:54,980 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-02-20 14:39:54,984 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:39:54,985 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:39:55,023 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:39:55,035 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:55,035 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:39:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:55,065 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:55,065 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:55,066 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1577492323, now seen corresponding path program 1 times [2022-02-20 14:39:55,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:55,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610030939] [2022-02-20 14:39:55,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:55,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:55,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#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); {37#true} is VALID [2022-02-20 14:39:55,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {37#true} is VALID [2022-02-20 14:39:55,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {37#true} is VALID [2022-02-20 14:39:55,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {37#true} is VALID [2022-02-20 14:39:55,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:55,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {38#false} is VALID [2022-02-20 14:39:55,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-02-20 14:39:55,299 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:55,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:55,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610030939] [2022-02-20 14:39:55,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610030939] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:55,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:55,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:55,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932579523] [2022-02-20 14:39:55,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:55,312 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:55,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:55,316 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:55,345 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:55,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:55,347 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:55,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:55,389 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,521 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2022-02-20 14:39:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:55,521 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:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:55,522 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:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-02-20 14:39:55,528 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:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-02-20 14:39:55,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 121 transitions. [2022-02-20 14:39:55,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:55,648 INFO L225 Difference]: With dead ends: 71 [2022-02-20 14:39:55,648 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 14:39:55,650 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:55,653 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 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:55,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 115 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:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 14:39:55,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2022-02-20 14:39:55,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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:55,678 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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:55,678 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,683 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2022-02-20 14:39:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2022-02-20 14:39:55,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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 57 states. [2022-02-20 14:39:55,685 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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 57 states. [2022-02-20 14:39:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,690 INFO L93 Difference]: Finished difference Result 57 states and 101 transitions. [2022-02-20 14:39:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 101 transitions. [2022-02-20 14:39:55,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:55,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 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:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2022-02-20 14:39:55,695 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2022-02-20 14:39:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:55,695 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2022-02-20 14:39:55,696 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:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2022-02-20 14:39:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:55,697 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:55,697 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:55,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:39:55,697 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash -876427745, now seen corresponding path program 1 times [2022-02-20 14:39:55,698 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:55,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813943223] [2022-02-20 14:39:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:55,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:55,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {279#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); {279#true} is VALID [2022-02-20 14:39:55,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {279#true} is VALID [2022-02-20 14:39:55,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {279#true} is VALID [2022-02-20 14:39:55,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {279#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {279#true} is VALID [2022-02-20 14:39:55,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {279#true} assume !(0 != main_~p1~0#1); {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:55,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:55,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:55,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:55,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:55,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:55,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:55,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:55,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {281#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {280#false} is VALID [2022-02-20 14:39:55,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {280#false} assume 1 != main_~lk1~0#1; {280#false} is VALID [2022-02-20 14:39:55,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {280#false} assume !false; {280#false} is VALID [2022-02-20 14:39:55,758 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:55,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:55,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813943223] [2022-02-20 14:39:55,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813943223] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:55,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:55,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:55,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501371586] [2022-02-20 14:39:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:55,760 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:55,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:55,761 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:55,772 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:55,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:55,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:55,774 INFO L87 Difference]: Start difference. First operand 39 states and 70 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:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,860 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2022-02-20 14:39:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:55,860 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:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:55,861 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:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2022-02-20 14:39:55,864 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:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2022-02-20 14:39:55,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2022-02-20 14:39:55,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:55,969 INFO L225 Difference]: With dead ends: 94 [2022-02-20 14:39:55,970 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 14:39:55,970 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:55,971 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 115 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:55,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 115 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:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 14:39:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-02-20 14:39:55,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:55,978 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:55,978 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,981 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2022-02-20 14:39:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2022-02-20 14:39:55,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 14:39:55,983 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 14:39:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,002 INFO L93 Difference]: Finished difference Result 57 states and 99 transitions. [2022-02-20 14:39:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2022-02-20 14:39:56,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-02-20 14:39:56,006 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2022-02-20 14:39:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,006 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-02-20 14:39:56,006 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:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-02-20 14:39:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:56,007 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,007 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:56,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:39:56,008 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1657407761, now seen corresponding path program 1 times [2022-02-20 14:39:56,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950002269] [2022-02-20 14:39:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#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); {556#true} is VALID [2022-02-20 14:39:56,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {556#true} is VALID [2022-02-20 14:39:56,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {556#true} is VALID [2022-02-20 14:39:56,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {556#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {556#true} is VALID [2022-02-20 14:39:56,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {556#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:56,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:56,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:56,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:56,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:56,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:56,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:56,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:56,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {558#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {557#false} is VALID [2022-02-20 14:39:56,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {557#false} assume 0 != main_~p2~0#1; {557#false} is VALID [2022-02-20 14:39:56,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {557#false} assume 1 != main_~lk2~0#1; {557#false} is VALID [2022-02-20 14:39:56,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {557#false} assume !false; {557#false} is VALID [2022-02-20 14:39:56,050 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:56,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950002269] [2022-02-20 14:39:56,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950002269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039751920] [2022-02-20 14:39:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,052 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:56,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,053 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:56,063 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:56,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:56,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:56,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:56,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:56,065 INFO L87 Difference]: Start difference. First operand 55 states and 98 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:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,146 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2022-02-20 14:39:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:56,146 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:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:56,146 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:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:39:56,149 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:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:39:56,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2022-02-20 14:39:56,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,255 INFO L225 Difference]: With dead ends: 87 [2022-02-20 14:39:56,255 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 14:39:56,256 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:56,257 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 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:56,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 128 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:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 14:39:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-02-20 14:39:56,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:56,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 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:56,262 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 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:56,262 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 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:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,264 INFO L93 Difference]: Finished difference Result 60 states and 101 transitions. [2022-02-20 14:39:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 101 transitions. [2022-02-20 14:39:56,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 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 60 states. [2022-02-20 14:39:56,266 INFO L87 Difference]: Start difference. First operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 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 60 states. [2022-02-20 14:39:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,268 INFO L93 Difference]: Finished difference Result 60 states and 101 transitions. [2022-02-20 14:39:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 101 transitions. [2022-02-20 14:39:56,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 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:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2022-02-20 14:39:56,271 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2022-02-20 14:39:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,271 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2022-02-20 14:39:56,272 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:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2022-02-20 14:39:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:56,272 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,272 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:56,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:39:56,273 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1399242323, now seen corresponding path program 1 times [2022-02-20 14:39:56,274 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,274 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146137161] [2022-02-20 14:39:56,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#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); {837#true} is VALID [2022-02-20 14:39:56,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {837#true} is VALID [2022-02-20 14:39:56,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {837#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {837#true} is VALID [2022-02-20 14:39:56,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {837#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {837#true} is VALID [2022-02-20 14:39:56,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {837#true} assume !(0 != main_~p1~0#1); {837#true} is VALID [2022-02-20 14:39:56,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {837#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:56,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {839#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {838#false} is VALID [2022-02-20 14:39:56,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {838#false} assume !false; {838#false} is VALID [2022-02-20 14:39:56,312 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:56,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146137161] [2022-02-20 14:39:56,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146137161] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,313 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,313 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781727946] [2022-02-20 14:39:56,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,314 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:56,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,314 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:56,325 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:56,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:56,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:56,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:56,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:56,326 INFO L87 Difference]: Start difference. First operand 58 states and 100 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:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,379 INFO L93 Difference]: Finished difference Result 109 states and 189 transitions. [2022-02-20 14:39:56,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:56,379 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:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:56,379 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:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 14:39:56,381 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:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 14:39:56,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2022-02-20 14:39:56,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,444 INFO L225 Difference]: With dead ends: 109 [2022-02-20 14:39:56,444 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 14:39:56,444 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:56,445 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 101 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:56,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 101 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:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 14:39:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2022-02-20 14:39:56,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:56,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 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:56,457 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 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:56,457 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 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:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,461 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2022-02-20 14:39:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 186 transitions. [2022-02-20 14:39:56,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 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 107 states. [2022-02-20 14:39:56,462 INFO L87 Difference]: Start difference. First operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 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 107 states. [2022-02-20 14:39:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,466 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2022-02-20 14:39:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 186 transitions. [2022-02-20 14:39:56,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.75) internal successors, (133), 76 states have internal predecessors, (133), 0 states have call successors, (0), 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:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 133 transitions. [2022-02-20 14:39:56,469 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 133 transitions. Word has length 16 [2022-02-20 14:39:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,470 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 133 transitions. [2022-02-20 14:39:56,470 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:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 133 transitions. [2022-02-20 14:39:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:56,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,471 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:56,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:39:56,471 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,472 INFO L85 PathProgramCache]: Analyzing trace with hash -698177745, now seen corresponding path program 1 times [2022-02-20 14:39:56,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497635490] [2022-02-20 14:39:56,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {1254#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); {1254#true} is VALID [2022-02-20 14:39:56,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {1254#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {1254#true} is VALID [2022-02-20 14:39:56,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {1254#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1254#true} is VALID [2022-02-20 14:39:56,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {1254#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {1254#true} is VALID [2022-02-20 14:39:56,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {1254#true} assume !(0 != main_~p1~0#1); {1254#true} is VALID [2022-02-20 14:39:56,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {1254#true} assume !(0 != main_~p2~0#1); {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:56,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:56,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:56,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:56,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:56,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:56,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:56,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:56,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {1256#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1255#false} is VALID [2022-02-20 14:39:56,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {1255#false} assume 1 != main_~lk2~0#1; {1255#false} is VALID [2022-02-20 14:39:56,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {1255#false} assume !false; {1255#false} is VALID [2022-02-20 14:39:56,508 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:56,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497635490] [2022-02-20 14:39:56,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497635490] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668587568] [2022-02-20 14:39:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,510 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:56,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,510 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:56,520 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:56,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:56,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:56,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:56,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:56,522 INFO L87 Difference]: Start difference. First operand 77 states and 133 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:56,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,575 INFO L93 Difference]: Finished difference Result 181 states and 315 transitions. [2022-02-20 14:39:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:56,576 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:56,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:56,576 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:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-20 14:39:56,577 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:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-20 14:39:56,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2022-02-20 14:39:56,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,654 INFO L225 Difference]: With dead ends: 181 [2022-02-20 14:39:56,654 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 14:39:56,655 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:56,656 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 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:56,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 116 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:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 14:39:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-02-20 14:39:56,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:56,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 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:56,662 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 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:56,663 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 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:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,666 INFO L93 Difference]: Finished difference Result 109 states and 184 transitions. [2022-02-20 14:39:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 184 transitions. [2022-02-20 14:39:56,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 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 109 states. [2022-02-20 14:39:56,667 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 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 109 states. [2022-02-20 14:39:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,670 INFO L93 Difference]: Finished difference Result 109 states and 184 transitions. [2022-02-20 14:39:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 184 transitions. [2022-02-20 14:39:56,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 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:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2022-02-20 14:39:56,675 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2022-02-20 14:39:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,675 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2022-02-20 14:39:56,675 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:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2022-02-20 14:39:56,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:56,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:56,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:39:56,676 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash -426624716, now seen corresponding path program 1 times [2022-02-20 14:39:56,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644305645] [2022-02-20 14:39:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {1781#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); {1781#true} is VALID [2022-02-20 14:39:56,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {1781#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {1781#true} is VALID [2022-02-20 14:39:56,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {1781#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {1781#true} is VALID [2022-02-20 14:39:56,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {1781#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {1781#true} is VALID [2022-02-20 14:39:56,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {1781#true} assume !(0 != main_~p1~0#1); {1781#true} is VALID [2022-02-20 14:39:56,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {1781#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:56,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:56,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:56,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:56,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:56,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:56,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:56,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:56,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {1783#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {1782#false} is VALID [2022-02-20 14:39:56,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {1782#false} assume 0 != main_~p3~0#1; {1782#false} is VALID [2022-02-20 14:39:56,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#false} assume 1 != main_~lk3~0#1; {1782#false} is VALID [2022-02-20 14:39:56,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#false} assume !false; {1782#false} is VALID [2022-02-20 14:39:56,714 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:56,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644305645] [2022-02-20 14:39:56,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644305645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562277688] [2022-02-20 14:39:56,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 14:39:56,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:56,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:56,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:56,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:56,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:56,728 INFO L87 Difference]: Start difference. First operand 107 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,783 INFO L93 Difference]: Finished difference Result 162 states and 274 transitions. [2022-02-20 14:39:56,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:56,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 14:39:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 14:39:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 14:39:56,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2022-02-20 14:39:56,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,878 INFO L225 Difference]: With dead ends: 162 [2022-02-20 14:39:56,879 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 14:39:56,879 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:56,880 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 39 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 124 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:56,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 124 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:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 14:39:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2022-02-20 14:39:56,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:56,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 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:56,886 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 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:56,886 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 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:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,889 INFO L93 Difference]: Finished difference Result 111 states and 184 transitions. [2022-02-20 14:39:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 184 transitions. [2022-02-20 14:39:56,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 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 111 states. [2022-02-20 14:39:56,891 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 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 111 states. [2022-02-20 14:39:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,894 INFO L93 Difference]: Finished difference Result 111 states and 184 transitions. [2022-02-20 14:39:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 184 transitions. [2022-02-20 14:39:56,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6944444444444444) internal successors, (183), 108 states have internal predecessors, (183), 0 states have call successors, (0), 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:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 183 transitions. [2022-02-20 14:39:56,898 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 183 transitions. Word has length 17 [2022-02-20 14:39:56,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,899 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 183 transitions. [2022-02-20 14:39:56,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 183 transitions. [2022-02-20 14:39:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:56,900 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:56,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:39:56,900 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash -168459278, now seen corresponding path program 1 times [2022-02-20 14:39:56,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163524073] [2022-02-20 14:39:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {2295#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); {2295#true} is VALID [2022-02-20 14:39:56,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {2295#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {2295#true} is VALID [2022-02-20 14:39:56,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {2295#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {2295#true} is VALID [2022-02-20 14:39:56,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {2295#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {2295#true} is VALID [2022-02-20 14:39:56,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {2295#true} assume !(0 != main_~p1~0#1); {2295#true} is VALID [2022-02-20 14:39:56,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {2295#true} assume !(0 != main_~p2~0#1); {2295#true} is VALID [2022-02-20 14:39:56,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {2295#true} assume !(0 != main_~p3~0#1); {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:56,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:56,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:56,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:56,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:56,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:56,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:56,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:56,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {2297#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {2296#false} is VALID [2022-02-20 14:39:56,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {2296#false} assume 1 != main_~lk3~0#1; {2296#false} is VALID [2022-02-20 14:39:56,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2022-02-20 14:39:56,938 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:56,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163524073] [2022-02-20 14:39:56,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163524073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318572539] [2022-02-20 14:39:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 14:39:56,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:56,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:56,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:56,951 INFO L87 Difference]: Start difference. First operand 109 states and 183 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,013 INFO L93 Difference]: Finished difference Result 309 states and 521 transitions. [2022-02-20 14:39:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 14:39:57,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:39:57,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:39:57,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2022-02-20 14:39:57,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,107 INFO L225 Difference]: With dead ends: 309 [2022-02-20 14:39:57,107 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 14:39:57,108 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:57,109 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 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:57,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 103 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:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 14:39:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2022-02-20 14:39:57,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 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:57,116 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 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:57,116 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 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:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,122 INFO L93 Difference]: Finished difference Result 207 states and 340 transitions. [2022-02-20 14:39:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 340 transitions. [2022-02-20 14:39:57,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 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 207 states. [2022-02-20 14:39:57,123 INFO L87 Difference]: Start difference. First operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 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 207 states. [2022-02-20 14:39:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,129 INFO L93 Difference]: Finished difference Result 207 states and 340 transitions. [2022-02-20 14:39:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 340 transitions. [2022-02-20 14:39:57,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.661764705882353) internal successors, (339), 204 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:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 339 transitions. [2022-02-20 14:39:57,136 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 339 transitions. Word has length 17 [2022-02-20 14:39:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,136 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 339 transitions. [2022-02-20 14:39:57,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,137 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 339 transitions. [2022-02-20 14:39:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:57,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:57,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:39:57,138 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash -869523856, now seen corresponding path program 1 times [2022-02-20 14:39:57,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207461494] [2022-02-20 14:39:57,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {3254#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); {3254#true} is VALID [2022-02-20 14:39:57,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {3254#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {3254#true} is VALID [2022-02-20 14:39:57,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {3254#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {3254#true} is VALID [2022-02-20 14:39:57,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {3254#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {3254#true} is VALID [2022-02-20 14:39:57,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {3254#true} assume !(0 != main_~p1~0#1); {3254#true} is VALID [2022-02-20 14:39:57,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {3254#true} assume !(0 != main_~p2~0#1); {3254#true} is VALID [2022-02-20 14:39:57,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {3254#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:57,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {3256#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {3255#false} is VALID [2022-02-20 14:39:57,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {3255#false} assume !false; {3255#false} is VALID [2022-02-20 14:39:57,182 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:57,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207461494] [2022-02-20 14:39:57,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207461494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975123895] [2022-02-20 14:39:57,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 14:39:57,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,194 INFO L87 Difference]: Start difference. First operand 205 states and 339 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,250 INFO L93 Difference]: Finished difference Result 257 states and 429 transitions. [2022-02-20 14:39:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-02-20 14:39:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-20 14:39:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-20 14:39:57,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2022-02-20 14:39:57,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,308 INFO L225 Difference]: With dead ends: 257 [2022-02-20 14:39:57,308 INFO L226 Difference]: Without dead ends: 255 [2022-02-20 14:39:57,309 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:57,309 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 134 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:57,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 134 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:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-02-20 14:39:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 205. [2022-02-20 14:39:57,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 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:57,316 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 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:57,316 INFO L87 Difference]: Start difference. First operand 255 states. Second operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 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:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,330 INFO L93 Difference]: Finished difference Result 255 states and 424 transitions. [2022-02-20 14:39:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 424 transitions. [2022-02-20 14:39:57,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 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 255 states. [2022-02-20 14:39:57,332 INFO L87 Difference]: Start difference. First operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 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 255 states. [2022-02-20 14:39:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,339 INFO L93 Difference]: Finished difference Result 255 states and 424 transitions. [2022-02-20 14:39:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 424 transitions. [2022-02-20 14:39:57,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.642156862745098) internal successors, (335), 204 states have internal predecessors, (335), 0 states have call successors, (0), 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:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2022-02-20 14:39:57,345 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 17 [2022-02-20 14:39:57,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,345 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2022-02-20 14:39:57,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2022-02-20 14:39:57,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:57,346 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:57,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:39:57,346 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash -927055644, now seen corresponding path program 1 times [2022-02-20 14:39:57,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785419473] [2022-02-20 14:39:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {4257#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); {4257#true} is VALID [2022-02-20 14:39:57,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {4257#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {4257#true} is VALID [2022-02-20 14:39:57,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {4257#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {4257#true} is VALID [2022-02-20 14:39:57,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {4257#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {4257#true} is VALID [2022-02-20 14:39:57,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {4257#true} assume !(0 != main_~p1~0#1); {4257#true} is VALID [2022-02-20 14:39:57,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {4257#true} assume !(0 != main_~p2~0#1); {4257#true} is VALID [2022-02-20 14:39:57,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {4257#true} assume !(0 != main_~p3~0#1); {4257#true} is VALID [2022-02-20 14:39:57,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {4257#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:57,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {4259#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {4258#false} is VALID [2022-02-20 14:39:57,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {4258#false} assume !false; {4258#false} is VALID [2022-02-20 14:39:57,377 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:57,378 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,378 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785419473] [2022-02-20 14:39:57,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785419473] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,378 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701199202] [2022-02-20 14:39:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 14:39:57,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,391 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,441 INFO L93 Difference]: Finished difference Result 373 states and 617 transitions. [2022-02-20 14:39:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 14:39:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 14:39:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 14:39:57,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-02-20 14:39:57,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,496 INFO L225 Difference]: With dead ends: 373 [2022-02-20 14:39:57,496 INFO L226 Difference]: Without dead ends: 371 [2022-02-20 14:39:57,496 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:57,497 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 97 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:57,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 97 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:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-02-20 14:39:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 289. [2022-02-20 14:39:57,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,504 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,505 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,513 INFO L93 Difference]: Finished difference Result 371 states and 608 transitions. [2022-02-20 14:39:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 608 transitions. [2022-02-20 14:39:57,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 371 states. [2022-02-20 14:39:57,515 INFO L87 Difference]: Start difference. First operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 371 states. [2022-02-20 14:39:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,524 INFO L93 Difference]: Finished difference Result 371 states and 608 transitions. [2022-02-20 14:39:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 608 transitions. [2022-02-20 14:39:57,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.6076388888888888) internal successors, (463), 288 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 463 transitions. [2022-02-20 14:39:57,531 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 463 transitions. Word has length 18 [2022-02-20 14:39:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,531 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 463 transitions. [2022-02-20 14:39:57,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 463 transitions. [2022-02-20 14:39:57,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:57,532 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:57,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:39:57,532 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,533 INFO L85 PathProgramCache]: Analyzing trace with hash -225991066, now seen corresponding path program 1 times [2022-02-20 14:39:57,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972944347] [2022-02-20 14:39:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {5696#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); {5696#true} is VALID [2022-02-20 14:39:57,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {5696#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {5696#true} is VALID [2022-02-20 14:39:57,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {5696#true} is VALID [2022-02-20 14:39:57,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {5696#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {5696#true} is VALID [2022-02-20 14:39:57,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {5696#true} assume !(0 != main_~p1~0#1); {5696#true} is VALID [2022-02-20 14:39:57,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#true} assume !(0 != main_~p2~0#1); {5696#true} is VALID [2022-02-20 14:39:57,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#true} assume !(0 != main_~p3~0#1); {5696#true} is VALID [2022-02-20 14:39:57,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#true} assume !(0 != main_~p4~0#1); {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:57,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:57,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:57,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:57,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:57,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:57,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:57,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:57,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {5698#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {5697#false} is VALID [2022-02-20 14:39:57,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {5697#false} assume 1 != main_~lk4~0#1; {5697#false} is VALID [2022-02-20 14:39:57,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {5697#false} assume !false; {5697#false} is VALID [2022-02-20 14:39:57,561 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:57,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972944347] [2022-02-20 14:39:57,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972944347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573678711] [2022-02-20 14:39:57,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 14:39:57,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,573 INFO L87 Difference]: Start difference. First operand 289 states and 463 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,640 INFO L93 Difference]: Finished difference Result 677 states and 1089 transitions. [2022-02-20 14:39:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-02-20 14:39:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-02-20 14:39:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2022-02-20 14:39:57,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 143 transitions. [2022-02-20 14:39:57,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,720 INFO L225 Difference]: With dead ends: 677 [2022-02-20 14:39:57,721 INFO L226 Difference]: Without dead ends: 395 [2022-02-20 14:39:57,723 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:57,724 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 118 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:57,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 118 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:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-02-20 14:39:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2022-02-20 14:39:57,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 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:57,734 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 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:57,738 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 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:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,748 INFO L93 Difference]: Finished difference Result 395 states and 620 transitions. [2022-02-20 14:39:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 620 transitions. [2022-02-20 14:39:57,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 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 395 states. [2022-02-20 14:39:57,756 INFO L87 Difference]: Start difference. First operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 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 395 states. [2022-02-20 14:39:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,763 INFO L93 Difference]: Finished difference Result 395 states and 620 transitions. [2022-02-20 14:39:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 620 transitions. [2022-02-20 14:39:57,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.5790816326530612) internal successors, (619), 392 states have internal predecessors, (619), 0 states have call successors, (0), 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:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 619 transitions. [2022-02-20 14:39:57,772 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 619 transitions. Word has length 18 [2022-02-20 14:39:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,772 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 619 transitions. [2022-02-20 14:39:57,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 619 transitions. [2022-02-20 14:39:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:57,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,773 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:57,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:39:57,773 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1326261127, now seen corresponding path program 1 times [2022-02-20 14:39:57,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933513030] [2022-02-20 14:39:57,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {7607#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); {7607#true} is VALID [2022-02-20 14:39:57,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {7607#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {7607#true} is VALID [2022-02-20 14:39:57,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {7607#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {7607#true} is VALID [2022-02-20 14:39:57,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {7607#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {7607#true} is VALID [2022-02-20 14:39:57,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {7607#true} assume !(0 != main_~p1~0#1); {7607#true} is VALID [2022-02-20 14:39:57,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {7607#true} assume !(0 != main_~p2~0#1); {7607#true} is VALID [2022-02-20 14:39:57,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {7607#true} assume !(0 != main_~p3~0#1); {7607#true} is VALID [2022-02-20 14:39:57,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {7607#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:57,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:57,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:57,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:57,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:57,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:57,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:57,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:57,809 INFO L290 TraceCheckUtils]: 15: Hoare triple {7609#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {7608#false} is VALID [2022-02-20 14:39:57,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {7608#false} assume 0 != main_~p5~0#1; {7608#false} is VALID [2022-02-20 14:39:57,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {7608#false} assume 1 != main_~lk5~0#1; {7608#false} is VALID [2022-02-20 14:39:57,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {7608#false} assume !false; {7608#false} is VALID [2022-02-20 14:39:57,812 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:57,812 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,812 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933513030] [2022-02-20 14:39:57,812 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933513030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,813 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,813 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,813 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922189265] [2022-02-20 14:39:57,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:57,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:57,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,823 INFO L87 Difference]: Start difference. First operand 393 states and 619 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,874 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2022-02-20 14:39:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 14:39:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 14:39:57,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-20 14:39:57,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,947 INFO L225 Difference]: With dead ends: 597 [2022-02-20 14:39:57,947 INFO L226 Difference]: Without dead ends: 407 [2022-02-20 14:39:57,947 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:57,948 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 116 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:57,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 116 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:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-02-20 14:39:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2022-02-20 14:39:57,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 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:57,954 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 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:57,955 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 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:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,961 INFO L93 Difference]: Finished difference Result 407 states and 628 transitions. [2022-02-20 14:39:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 628 transitions. [2022-02-20 14:39:57,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 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 407 states. [2022-02-20 14:39:57,963 INFO L87 Difference]: Start difference. First operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 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 407 states. [2022-02-20 14:39:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,970 INFO L93 Difference]: Finished difference Result 407 states and 628 transitions. [2022-02-20 14:39:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 628 transitions. [2022-02-20 14:39:57,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 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:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2022-02-20 14:39:57,978 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2022-02-20 14:39:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,978 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2022-02-20 14:39:57,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2022-02-20 14:39:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:57,978 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:57,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:39:57,979 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1584426565, now seen corresponding path program 1 times [2022-02-20 14:39:57,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910375657] [2022-02-20 14:39:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {9474#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); {9474#true} is VALID [2022-02-20 14:39:58,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {9474#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {9474#true} is VALID [2022-02-20 14:39:58,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {9474#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {9474#true} is VALID [2022-02-20 14:39:58,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {9474#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {9474#true} is VALID [2022-02-20 14:39:58,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {9474#true} assume !(0 != main_~p1~0#1); {9474#true} is VALID [2022-02-20 14:39:58,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {9474#true} assume !(0 != main_~p2~0#1); {9474#true} is VALID [2022-02-20 14:39:58,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {9474#true} assume !(0 != main_~p3~0#1); {9474#true} is VALID [2022-02-20 14:39:58,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {9474#true} assume !(0 != main_~p4~0#1); {9474#true} is VALID [2022-02-20 14:39:58,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {9474#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:58,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {9476#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {9475#false} is VALID [2022-02-20 14:39:58,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {9475#false} assume !false; {9475#false} is VALID [2022-02-20 14:39:58,004 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:58,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910375657] [2022-02-20 14:39:58,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910375657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102695192] [2022-02-20 14:39:58,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:58,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,016 INFO L87 Difference]: Start difference. First operand 405 states and 627 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,070 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2022-02-20 14:39:58,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:58,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:58,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 14:39:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 14:39:58,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-02-20 14:39:58,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,132 INFO L225 Difference]: With dead ends: 713 [2022-02-20 14:39:58,132 INFO L226 Difference]: Without dead ends: 711 [2022-02-20 14:39:58,132 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:58,133 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 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:58,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 95 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:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-02-20 14:39:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2022-02-20 14:39:58,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:58,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 711 states. Second operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 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:58,157 INFO L74 IsIncluded]: Start isIncluded. First operand 711 states. Second operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 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:58,157 INFO L87 Difference]: Start difference. First operand 711 states. Second operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 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:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,174 INFO L93 Difference]: Finished difference Result 711 states and 1100 transitions. [2022-02-20 14:39:58,174 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1100 transitions. [2022-02-20 14:39:58,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 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 711 states. [2022-02-20 14:39:58,176 INFO L87 Difference]: Start difference. First operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 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 711 states. [2022-02-20 14:39:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,192 INFO L93 Difference]: Finished difference Result 711 states and 1100 transitions. [2022-02-20 14:39:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1100 transitions. [2022-02-20 14:39:58,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:58,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 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:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2022-02-20 14:39:58,206 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2022-02-20 14:39:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:58,206 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2022-02-20 14:39:58,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2022-02-20 14:39:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:58,207 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:58,207 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:58,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:39:58,208 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2009476153, now seen corresponding path program 1 times [2022-02-20 14:39:58,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:58,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902429534] [2022-02-20 14:39:58,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:58,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {12249#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); {12249#true} is VALID [2022-02-20 14:39:58,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {12249#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {12249#true} is VALID [2022-02-20 14:39:58,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {12249#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {12249#true} is VALID [2022-02-20 14:39:58,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {12249#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {12249#true} is VALID [2022-02-20 14:39:58,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {12249#true} assume !(0 != main_~p1~0#1); {12249#true} is VALID [2022-02-20 14:39:58,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {12249#true} assume !(0 != main_~p2~0#1); {12249#true} is VALID [2022-02-20 14:39:58,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {12249#true} assume !(0 != main_~p3~0#1); {12249#true} is VALID [2022-02-20 14:39:58,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {12249#true} assume !(0 != main_~p4~0#1); {12249#true} is VALID [2022-02-20 14:39:58,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {12249#true} assume !(0 != main_~p5~0#1); {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:58,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:58,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:58,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:58,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:58,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:58,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:58,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:58,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {12251#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {12250#false} is VALID [2022-02-20 14:39:58,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {12250#false} assume 1 != main_~lk5~0#1; {12250#false} is VALID [2022-02-20 14:39:58,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {12250#false} assume !false; {12250#false} is VALID [2022-02-20 14:39:58,231 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:58,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902429534] [2022-02-20 14:39:58,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902429534] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511385303] [2022-02-20 14:39:58,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:58,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,242 INFO L87 Difference]: Start difference. First operand 581 states and 875 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,337 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2022-02-20 14:39:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 14:39:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 14:39:58,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 14:39:58,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,427 INFO L225 Difference]: With dead ends: 1337 [2022-02-20 14:39:58,427 INFO L226 Difference]: Without dead ends: 775 [2022-02-20 14:39:58,428 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:58,428 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 119 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:58,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 119 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:58,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-02-20 14:39:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2022-02-20 14:39:58,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:58,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 775 states. Second operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 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:58,440 INFO L74 IsIncluded]: Start isIncluded. First operand 775 states. Second operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 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:58,441 INFO L87 Difference]: Start difference. First operand 775 states. Second operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 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:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,462 INFO L93 Difference]: Finished difference Result 775 states and 1140 transitions. [2022-02-20 14:39:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1140 transitions. [2022-02-20 14:39:58,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 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 775 states. [2022-02-20 14:39:58,464 INFO L87 Difference]: Start difference. First operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 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 775 states. [2022-02-20 14:39:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,484 INFO L93 Difference]: Finished difference Result 775 states and 1140 transitions. [2022-02-20 14:39:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1140 transitions. [2022-02-20 14:39:58,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:58,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 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:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2022-02-20 14:39:58,509 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2022-02-20 14:39:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:58,510 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2022-02-20 14:39:58,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2022-02-20 14:39:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:58,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:58,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:58,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 14:39:58,512 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1872798619, now seen corresponding path program 1 times [2022-02-20 14:39:58,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:58,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400854837] [2022-02-20 14:39:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:58,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {16000#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); {16000#true} is VALID [2022-02-20 14:39:58,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {16000#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {16000#true} is VALID [2022-02-20 14:39:58,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {16000#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {16000#true} is VALID [2022-02-20 14:39:58,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {16000#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {16000#true} is VALID [2022-02-20 14:39:58,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {16000#true} assume !(0 != main_~p1~0#1); {16000#true} is VALID [2022-02-20 14:39:58,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {16000#true} assume !(0 != main_~p2~0#1); {16000#true} is VALID [2022-02-20 14:39:58,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {16000#true} assume !(0 != main_~p3~0#1); {16000#true} is VALID [2022-02-20 14:39:58,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {16000#true} assume !(0 != main_~p4~0#1); {16000#true} is VALID [2022-02-20 14:39:58,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {16000#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:58,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:58,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:58,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:58,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:58,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:58,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:58,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:58,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {16002#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {16001#false} is VALID [2022-02-20 14:39:58,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {16001#false} assume 0 != main_~p6~0#1; {16001#false} is VALID [2022-02-20 14:39:58,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {16001#false} assume 1 != main_~lk6~0#1; {16001#false} is VALID [2022-02-20 14:39:58,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {16001#false} assume !false; {16001#false} is VALID [2022-02-20 14:39:58,533 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:58,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400854837] [2022-02-20 14:39:58,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400854837] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894585152] [2022-02-20 14:39:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:58,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:58,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,558 INFO L87 Difference]: Start difference. First operand 773 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:58,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,678 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2022-02-20 14:39:58,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:58,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:58,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 14:39:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 14:39:58,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2022-02-20 14:39:58,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,768 INFO L225 Difference]: With dead ends: 1161 [2022-02-20 14:39:58,768 INFO L226 Difference]: Without dead ends: 791 [2022-02-20 14:39:58,769 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:58,770 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 112 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:58,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 112 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:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-02-20 14:39:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2022-02-20 14:39:58,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:58,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 791 states. Second operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 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:58,793 INFO L74 IsIncluded]: Start isIncluded. First operand 791 states. Second operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 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:58,793 INFO L87 Difference]: Start difference. First operand 791 states. Second operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 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:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,815 INFO L93 Difference]: Finished difference Result 791 states and 1140 transitions. [2022-02-20 14:39:58,816 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1140 transitions. [2022-02-20 14:39:58,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 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 791 states. [2022-02-20 14:39:58,818 INFO L87 Difference]: Start difference. First operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 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 791 states. [2022-02-20 14:39:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,839 INFO L93 Difference]: Finished difference Result 791 states and 1140 transitions. [2022-02-20 14:39:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1140 transitions. [2022-02-20 14:39:58,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:58,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 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:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2022-02-20 14:39:58,865 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2022-02-20 14:39:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:58,865 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2022-02-20 14:39:58,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2022-02-20 14:39:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:58,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:58,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:58,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 14:39:58,870 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:58,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2130964057, now seen corresponding path program 1 times [2022-02-20 14:39:58,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:58,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920863650] [2022-02-20 14:39:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:58,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {19623#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); {19623#true} is VALID [2022-02-20 14:39:58,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {19623#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {19623#true} is VALID [2022-02-20 14:39:58,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {19623#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {19623#true} is VALID [2022-02-20 14:39:58,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {19623#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {19623#true} is VALID [2022-02-20 14:39:58,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {19623#true} assume !(0 != main_~p1~0#1); {19623#true} is VALID [2022-02-20 14:39:58,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {19623#true} assume !(0 != main_~p2~0#1); {19623#true} is VALID [2022-02-20 14:39:58,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {19623#true} assume !(0 != main_~p3~0#1); {19623#true} is VALID [2022-02-20 14:39:58,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {19623#true} assume !(0 != main_~p4~0#1); {19623#true} is VALID [2022-02-20 14:39:58,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {19623#true} assume !(0 != main_~p5~0#1); {19623#true} is VALID [2022-02-20 14:39:58,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {19623#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:58,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {19625#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {19624#false} is VALID [2022-02-20 14:39:58,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {19624#false} assume !false; {19624#false} is VALID [2022-02-20 14:39:58,921 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:58,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920863650] [2022-02-20 14:39:58,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920863650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,922 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,922 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28343514] [2022-02-20 14:39:58,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:58,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:58,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,935 INFO L87 Difference]: Start difference. First operand 789 states and 1139 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,027 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2022-02-20 14:39:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:59,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-02-20 14:39:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-02-20 14:39:59,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2022-02-20 14:39:59,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:59,126 INFO L225 Difference]: With dead ends: 1353 [2022-02-20 14:39:59,126 INFO L226 Difference]: Without dead ends: 1351 [2022-02-20 14:39:59,127 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:59,127 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 23 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 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:59,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 93 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:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-02-20 14:39:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2022-02-20 14:39:59,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:59,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1351 states. Second operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 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:59,163 INFO L74 IsIncluded]: Start isIncluded. First operand 1351 states. Second operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 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:59,164 INFO L87 Difference]: Start difference. First operand 1351 states. Second operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 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:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,228 INFO L93 Difference]: Finished difference Result 1351 states and 1940 transitions. [2022-02-20 14:39:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1940 transitions. [2022-02-20 14:39:59,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 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 1351 states. [2022-02-20 14:39:59,233 INFO L87 Difference]: Start difference. First operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 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 1351 states. [2022-02-20 14:39:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,285 INFO L93 Difference]: Finished difference Result 1351 states and 1940 transitions. [2022-02-20 14:39:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1940 transitions. [2022-02-20 14:39:59,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:59,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 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:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2022-02-20 14:39:59,328 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2022-02-20 14:39:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:59,328 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2022-02-20 14:39:59,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2022-02-20 14:39:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:59,330 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:59,330 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:59,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 14:39:59,330 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:59,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:59,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1462938661, now seen corresponding path program 1 times [2022-02-20 14:39:59,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:59,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448203489] [2022-02-20 14:39:59,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:59,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:59,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {24942#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); {24942#true} is VALID [2022-02-20 14:39:59,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {24942#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {24942#true} is VALID [2022-02-20 14:39:59,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {24942#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {24942#true} is VALID [2022-02-20 14:39:59,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {24942#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {24942#true} is VALID [2022-02-20 14:39:59,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {24942#true} assume !(0 != main_~p1~0#1); {24942#true} is VALID [2022-02-20 14:39:59,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {24942#true} assume !(0 != main_~p2~0#1); {24942#true} is VALID [2022-02-20 14:39:59,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {24942#true} assume !(0 != main_~p3~0#1); {24942#true} is VALID [2022-02-20 14:39:59,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {24942#true} assume !(0 != main_~p4~0#1); {24942#true} is VALID [2022-02-20 14:39:59,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {24942#true} assume !(0 != main_~p5~0#1); {24942#true} is VALID [2022-02-20 14:39:59,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {24942#true} assume !(0 != main_~p6~0#1); {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:59,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:59,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:59,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:59,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:59,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:59,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:59,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:59,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {24944#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {24943#false} is VALID [2022-02-20 14:39:59,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {24943#false} assume 1 != main_~lk6~0#1; {24943#false} is VALID [2022-02-20 14:39:59,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {24943#false} assume !false; {24943#false} is VALID [2022-02-20 14:39:59,355 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:59,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:59,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448203489] [2022-02-20 14:39:59,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448203489] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:59,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:59,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:59,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507431282] [2022-02-20 14:39:59,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:59,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:59,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:59,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:59,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:59,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:59,367 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,629 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2022-02-20 14:39:59,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:59,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-02-20 14:39:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-02-20 14:39:59,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2022-02-20 14:39:59,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:59,767 INFO L225 Difference]: With dead ends: 2633 [2022-02-20 14:39:59,767 INFO L226 Difference]: Without dead ends: 1511 [2022-02-20 14:39:59,768 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:59,769 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 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:59,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 120 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:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-02-20 14:39:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2022-02-20 14:39:59,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:59,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1511 states. Second operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 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:59,814 INFO L74 IsIncluded]: Start isIncluded. First operand 1511 states. Second operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 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:59,815 INFO L87 Difference]: Start difference. First operand 1511 states. Second operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 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:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,871 INFO L93 Difference]: Finished difference Result 1511 states and 2052 transitions. [2022-02-20 14:39:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2052 transitions. [2022-02-20 14:39:59,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 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 1511 states. [2022-02-20 14:39:59,876 INFO L87 Difference]: Start difference. First operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 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 1511 states. [2022-02-20 14:39:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,931 INFO L93 Difference]: Finished difference Result 1511 states and 2052 transitions. [2022-02-20 14:39:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2052 transitions. [2022-02-20 14:39:59,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:59,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 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:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2022-02-20 14:39:59,993 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2022-02-20 14:39:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:59,994 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2022-02-20 14:39:59,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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:59,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2022-02-20 14:39:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:39:59,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:59,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:59,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 14:39:59,996 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1635592028, now seen corresponding path program 1 times [2022-02-20 14:39:59,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:59,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998043197] [2022-02-20 14:39:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:00,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {32277#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); {32277#true} is VALID [2022-02-20 14:40:00,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {32277#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {32277#true} is VALID [2022-02-20 14:40:00,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {32277#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {32277#true} is VALID [2022-02-20 14:40:00,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {32277#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {32277#true} is VALID [2022-02-20 14:40:00,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {32277#true} assume !(0 != main_~p1~0#1); {32277#true} is VALID [2022-02-20 14:40:00,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {32277#true} assume !(0 != main_~p2~0#1); {32277#true} is VALID [2022-02-20 14:40:00,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {32277#true} assume !(0 != main_~p3~0#1); {32277#true} is VALID [2022-02-20 14:40:00,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {32277#true} assume !(0 != main_~p4~0#1); {32277#true} is VALID [2022-02-20 14:40:00,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {32277#true} assume !(0 != main_~p5~0#1); {32277#true} is VALID [2022-02-20 14:40:00,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {32277#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:00,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:00,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:00,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:00,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:00,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:00,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:00,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:00,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {32279#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {32278#false} is VALID [2022-02-20 14:40:00,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {32278#false} assume 0 != main_~p7~0#1; {32278#false} is VALID [2022-02-20 14:40:00,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {32278#false} assume 1 != main_~lk7~0#1; {32278#false} is VALID [2022-02-20 14:40:00,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {32278#false} assume !false; {32278#false} is VALID [2022-02-20 14:40:00,017 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:40:00,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:00,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998043197] [2022-02-20 14:40:00,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998043197] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:00,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:00,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:00,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758478717] [2022-02-20 14:40:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:00,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 14:40:00,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:00,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:00,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:00,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:00,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:00,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:00,028 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,207 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2022-02-20 14:40:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:00,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 14:40:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-02-20 14:40:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-02-20 14:40:00,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2022-02-20 14:40:00,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:00,344 INFO L225 Difference]: With dead ends: 2265 [2022-02-20 14:40:00,344 INFO L226 Difference]: Without dead ends: 1543 [2022-02-20 14:40:00,345 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:40:00,346 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 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:40:00,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-02-20 14:40:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2022-02-20 14:40:00,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:00,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1543 states. Second operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 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:40:00,377 INFO L74 IsIncluded]: Start isIncluded. First operand 1543 states. Second operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 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:40:00,378 INFO L87 Difference]: Start difference. First operand 1543 states. Second operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 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:40:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,446 INFO L93 Difference]: Finished difference Result 1543 states and 2052 transitions. [2022-02-20 14:40:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2052 transitions. [2022-02-20 14:40:00,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:00,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:00,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 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 1543 states. [2022-02-20 14:40:00,451 INFO L87 Difference]: Start difference. First operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 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 1543 states. [2022-02-20 14:40:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,516 INFO L93 Difference]: Finished difference Result 1543 states and 2052 transitions. [2022-02-20 14:40:00,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2052 transitions. [2022-02-20 14:40:00,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:00,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:00,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:00,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 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:40:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2022-02-20 14:40:00,592 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2022-02-20 14:40:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:00,592 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2022-02-20 14:40:00,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2022-02-20 14:40:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:40:00,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:00,594 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:00,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 14:40:00,594 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:00,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:00,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1893757466, now seen corresponding path program 1 times [2022-02-20 14:40:00,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:00,595 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998702705] [2022-02-20 14:40:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:00,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {39340#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); {39340#true} is VALID [2022-02-20 14:40:00,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {39340#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {39340#true} is VALID [2022-02-20 14:40:00,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {39340#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {39340#true} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {39340#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {39340#true} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {39340#true} assume !(0 != main_~p1~0#1); {39340#true} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {39340#true} assume !(0 != main_~p2~0#1); {39340#true} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {39340#true} assume !(0 != main_~p3~0#1); {39340#true} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {39340#true} assume !(0 != main_~p4~0#1); {39340#true} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {39340#true} assume !(0 != main_~p5~0#1); {39340#true} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {39340#true} assume !(0 != main_~p6~0#1); {39340#true} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {39340#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:00,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {39342#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {39341#false} is VALID [2022-02-20 14:40:00,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {39341#false} assume !false; {39341#false} is VALID [2022-02-20 14:40:00,616 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:40:00,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:00,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998702705] [2022-02-20 14:40:00,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998702705] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:00,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:00,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:00,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059533910] [2022-02-20 14:40:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:00,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 14:40:00,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:00,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:00,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:00,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:00,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:00,628 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,859 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2022-02-20 14:40:00,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:00,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 14:40:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-02-20 14:40:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-02-20 14:40:00,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 79 transitions. [2022-02-20 14:40:00,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:01,084 INFO L225 Difference]: With dead ends: 2569 [2022-02-20 14:40:01,084 INFO L226 Difference]: Without dead ends: 2567 [2022-02-20 14:40:01,085 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:40:01,085 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 91 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:40:01,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2022-02-20 14:40:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2022-02-20 14:40:01,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:01,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2567 states. Second operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 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:40:01,124 INFO L74 IsIncluded]: Start isIncluded. First operand 2567 states. Second operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 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:40:01,126 INFO L87 Difference]: Start difference. First operand 2567 states. Second operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 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:40:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,285 INFO L93 Difference]: Finished difference Result 2567 states and 3364 transitions. [2022-02-20 14:40:01,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3364 transitions. [2022-02-20 14:40:01,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:01,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:01,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 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 2567 states. [2022-02-20 14:40:01,291 INFO L87 Difference]: Start difference. First operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 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 2567 states. [2022-02-20 14:40:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,453 INFO L93 Difference]: Finished difference Result 2567 states and 3364 transitions. [2022-02-20 14:40:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3364 transitions. [2022-02-20 14:40:01,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:01,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:01,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:01,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 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:40:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2022-02-20 14:40:01,598 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2022-02-20 14:40:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:01,598 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2022-02-20 14:40:01,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2022-02-20 14:40:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:40:01,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:01,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:01,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 14:40:01,601 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:01,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1700145252, now seen corresponding path program 1 times [2022-02-20 14:40:01,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:01,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508439623] [2022-02-20 14:40:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:01,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:01,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {49555#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); {49555#true} is VALID [2022-02-20 14:40:01,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {49555#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {49555#true} is VALID [2022-02-20 14:40:01,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {49555#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {49555#true} is VALID [2022-02-20 14:40:01,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {49555#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {49555#true} is VALID [2022-02-20 14:40:01,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {49555#true} assume !(0 != main_~p1~0#1); {49555#true} is VALID [2022-02-20 14:40:01,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {49555#true} assume !(0 != main_~p2~0#1); {49555#true} is VALID [2022-02-20 14:40:01,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {49555#true} assume !(0 != main_~p3~0#1); {49555#true} is VALID [2022-02-20 14:40:01,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {49555#true} assume !(0 != main_~p4~0#1); {49555#true} is VALID [2022-02-20 14:40:01,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {49555#true} assume !(0 != main_~p5~0#1); {49555#true} is VALID [2022-02-20 14:40:01,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {49555#true} assume !(0 != main_~p6~0#1); {49555#true} is VALID [2022-02-20 14:40:01,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {49555#true} assume !(0 != main_~p7~0#1); {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:01,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:01,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:01,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:01,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:01,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:01,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:01,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:01,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {49557#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {49556#false} is VALID [2022-02-20 14:40:01,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {49556#false} assume 1 != main_~lk7~0#1; {49556#false} is VALID [2022-02-20 14:40:01,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {49556#false} assume !false; {49556#false} is VALID [2022-02-20 14:40:01,623 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:40:01,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:01,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508439623] [2022-02-20 14:40:01,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508439623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:01,623 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:01,623 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:01,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083397839] [2022-02-20 14:40:01,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:01,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 14:40:01,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:01,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:01,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:01,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:01,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:01,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:01,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:01,636 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:02,494 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2022-02-20 14:40:02,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:02,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 14:40:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-20 14:40:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-20 14:40:02,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2022-02-20 14:40:02,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:02,818 INFO L225 Difference]: With dead ends: 5193 [2022-02-20 14:40:02,818 INFO L226 Difference]: Without dead ends: 2951 [2022-02-20 14:40:02,820 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:40:02,820 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 121 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:40:02,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:02,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-02-20 14:40:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2022-02-20 14:40:02,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:02,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2951 states. Second operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 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:40:02,862 INFO L74 IsIncluded]: Start isIncluded. First operand 2951 states. Second operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 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:40:02,864 INFO L87 Difference]: Start difference. First operand 2951 states. Second operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 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:40:03,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:03,062 INFO L93 Difference]: Finished difference Result 2951 states and 3652 transitions. [2022-02-20 14:40:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 3652 transitions. [2022-02-20 14:40:03,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:03,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:03,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 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 2951 states. [2022-02-20 14:40:03,068 INFO L87 Difference]: Start difference. First operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 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 2951 states. [2022-02-20 14:40:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:03,284 INFO L93 Difference]: Finished difference Result 2951 states and 3652 transitions. [2022-02-20 14:40:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 3652 transitions. [2022-02-20 14:40:03,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:03,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:03,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:03,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 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:40:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2022-02-20 14:40:03,506 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2022-02-20 14:40:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:03,506 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2022-02-20 14:40:03,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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:40:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2022-02-20 14:40:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:40:03,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:03,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:03,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 14:40:03,508 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1422844656, now seen corresponding path program 1 times [2022-02-20 14:40:03,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:03,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634950578] [2022-02-20 14:40:03,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:03,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {63930#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); {63930#true} is VALID [2022-02-20 14:40:03,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {63930#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {63930#true} is VALID [2022-02-20 14:40:03,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {63930#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {63930#true} is VALID [2022-02-20 14:40:03,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {63930#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {63930#true} is VALID [2022-02-20 14:40:03,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {63930#true} assume !(0 != main_~p1~0#1); {63930#true} is VALID [2022-02-20 14:40:03,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {63930#true} assume !(0 != main_~p2~0#1); {63930#true} is VALID [2022-02-20 14:40:03,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {63930#true} assume !(0 != main_~p3~0#1); {63930#true} is VALID [2022-02-20 14:40:03,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {63930#true} assume !(0 != main_~p4~0#1); {63930#true} is VALID [2022-02-20 14:40:03,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {63930#true} assume !(0 != main_~p5~0#1); {63930#true} is VALID [2022-02-20 14:40:03,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {63930#true} assume !(0 != main_~p6~0#1); {63930#true} is VALID [2022-02-20 14:40:03,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {63930#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:03,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:03,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:03,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:03,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:03,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:03,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:03,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:03,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {63932#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {63931#false} is VALID [2022-02-20 14:40:03,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {63931#false} assume 0 != main_~p8~0#1; {63931#false} is VALID [2022-02-20 14:40:03,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {63931#false} assume 1 != main_~lk8~0#1; {63931#false} is VALID [2022-02-20 14:40:03,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {63931#false} assume !false; {63931#false} is VALID [2022-02-20 14:40:03,529 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:40:03,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:03,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634950578] [2022-02-20 14:40:03,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634950578] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:03,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:03,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:03,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208891001] [2022-02-20 14:40:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:03,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 14:40:03,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:03,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:03,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:03,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:03,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:03,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:03,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:03,540 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:04,111 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2022-02-20 14:40:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:04,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 14:40:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 14:40:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 14:40:04,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 14:40:04,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:04,436 INFO L225 Difference]: With dead ends: 4425 [2022-02-20 14:40:04,436 INFO L226 Difference]: Without dead ends: 3015 [2022-02-20 14:40:04,437 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:40:04,438 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 104 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:40:04,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2022-02-20 14:40:04,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2022-02-20 14:40:04,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:04,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3015 states. Second operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 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:40:04,478 INFO L74 IsIncluded]: Start isIncluded. First operand 3015 states. Second operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 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:40:04,480 INFO L87 Difference]: Start difference. First operand 3015 states. Second operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 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:40:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:04,696 INFO L93 Difference]: Finished difference Result 3015 states and 3652 transitions. [2022-02-20 14:40:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 3652 transitions. [2022-02-20 14:40:04,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:04,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:04,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 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 3015 states. [2022-02-20 14:40:04,702 INFO L87 Difference]: Start difference. First operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 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 3015 states. [2022-02-20 14:40:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:04,917 INFO L93 Difference]: Finished difference Result 3015 states and 3652 transitions. [2022-02-20 14:40:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 3652 transitions. [2022-02-20 14:40:04,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:04,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:04,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:04,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 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:40:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2022-02-20 14:40:05,169 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2022-02-20 14:40:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:05,169 INFO L470 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2022-02-20 14:40:05,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2022-02-20 14:40:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:40:05,171 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:05,171 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:05,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 14:40:05,172 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:05,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1164679218, now seen corresponding path program 1 times [2022-02-20 14:40:05,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:05,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989107228] [2022-02-20 14:40:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:05,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {77729#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); {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {77729#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {77729#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {77729#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {77729#true} assume !(0 != main_~p1~0#1); {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {77729#true} assume !(0 != main_~p2~0#1); {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {77729#true} assume !(0 != main_~p3~0#1); {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {77729#true} assume !(0 != main_~p4~0#1); {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {77729#true} assume !(0 != main_~p5~0#1); {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {77729#true} assume !(0 != main_~p6~0#1); {77729#true} is VALID [2022-02-20 14:40:05,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {77729#true} assume !(0 != main_~p7~0#1); {77729#true} is VALID [2022-02-20 14:40:05,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {77729#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:05,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {77731#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {77730#false} is VALID [2022-02-20 14:40:05,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {77730#false} assume !false; {77730#false} is VALID [2022-02-20 14:40:05,206 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:40:05,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:05,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989107228] [2022-02-20 14:40:05,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989107228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:05,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:05,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:05,207 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656397660] [2022-02-20 14:40:05,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:05,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 14:40:05,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:05,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:05,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:05,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:05,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:05,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:05,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:05,223 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:05,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:05,972 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2022-02-20 14:40:05,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:05,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 14:40:05,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-20 14:40:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-20 14:40:05,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-02-20 14:40:06,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:06,666 INFO L225 Difference]: With dead ends: 4871 [2022-02-20 14:40:06,666 INFO L226 Difference]: Without dead ends: 4869 [2022-02-20 14:40:06,667 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:40:06,667 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 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:40:06,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2022-02-20 14:40:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2022-02-20 14:40:06,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:06,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4869 states. Second operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 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:40:06,725 INFO L74 IsIncluded]: Start isIncluded. First operand 4869 states. Second operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 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:40:06,728 INFO L87 Difference]: Start difference. First operand 4869 states. Second operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 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:40:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:07,330 INFO L93 Difference]: Finished difference Result 4869 states and 5699 transitions. [2022-02-20 14:40:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 5699 transitions. [2022-02-20 14:40:07,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:07,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:07,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 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 4869 states. [2022-02-20 14:40:07,340 INFO L87 Difference]: Start difference. First operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 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 4869 states. [2022-02-20 14:40:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:07,942 INFO L93 Difference]: Finished difference Result 4869 states and 5699 transitions. [2022-02-20 14:40:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 5699 transitions. [2022-02-20 14:40:07,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:07,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:07,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:07,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 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:40:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2022-02-20 14:40:08,552 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2022-02-20 14:40:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:08,552 INFO L470 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2022-02-20 14:40:08,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2022-02-20 14:40:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:40:08,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:08,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:08,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 14:40:08,556 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -463614640, now seen corresponding path program 1 times [2022-02-20 14:40:08,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:08,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287764909] [2022-02-20 14:40:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:08,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {97345#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); {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {97345#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~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;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {97345#true} assume !false;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {97345#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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {97345#true} assume !(0 != main_~p1~0#1); {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {97345#true} assume !(0 != main_~p2~0#1); {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {97345#true} assume !(0 != main_~p3~0#1); {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {97345#true} assume !(0 != main_~p4~0#1); {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {97345#true} assume !(0 != main_~p5~0#1); {97345#true} is VALID [2022-02-20 14:40:08,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {97345#true} assume !(0 != main_~p6~0#1); {97345#true} is VALID [2022-02-20 14:40:08,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {97345#true} assume !(0 != main_~p7~0#1); {97345#true} is VALID [2022-02-20 14:40:08,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {97345#true} assume !(0 != main_~p8~0#1); {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:08,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:08,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:08,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:08,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:08,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:08,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:08,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:08,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {97347#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {97346#false} is VALID [2022-02-20 14:40:08,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {97346#false} assume 1 != main_~lk8~0#1; {97346#false} is VALID [2022-02-20 14:40:08,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {97346#false} assume !false; {97346#false} is VALID [2022-02-20 14:40:08,592 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:40:08,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:08,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287764909] [2022-02-20 14:40:08,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287764909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:08,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:08,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:08,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971838924] [2022-02-20 14:40:08,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:08,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 14:40:08,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:08,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:08,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:08,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:08,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:08,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:08,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:08,605 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:11,396 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2022-02-20 14:40:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:11,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-02-20 14:40:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:11,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 14:40:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 14:40:11,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 14:40:11,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:11,463 INFO L225 Difference]: With dead ends: 10245 [2022-02-20 14:40:11,463 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:40:11,468 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:40:11,468 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 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:40:11,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:40:11,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:40:11,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:11,469 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:40:11,469 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:40:11,470 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:40:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:11,470 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:40:11,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:40:11,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:11,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:11,470 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:40:11,470 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:40:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:11,471 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:40:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:40:11,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:11,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:11,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:11,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:11,471 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:40:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:40:11,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-02-20 14:40:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:11,472 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:40:11,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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:40:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:40:11,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:11,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:40:11,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 14:40:11,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:40:11,485 INFO L858 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-02-20 14:40:11,485 INFO L858 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-02-20 14:40:11,486 INFO L858 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,486 INFO L861 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-02-20 14:40:11,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:40:11,486 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:40:11,486 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,486 INFO L858 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,487 INFO L861 garLoopResultBuilder]: At program point L136(lines 6 137) the Hoare annotation is: true [2022-02-20 14:40:11,487 INFO L858 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-02-20 14:40:11,487 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-02-20 14:40:11,487 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,487 INFO L858 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-02-20 14:40:11,487 INFO L854 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-02-20 14:40:11,488 INFO L858 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,488 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,488 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-02-20 14:40:11,488 INFO L858 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,488 INFO L858 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,490 INFO L858 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-02-20 14:40:11,490 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:40:11,490 INFO L858 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-02-20 14:40:11,490 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-02-20 14:40:11,490 INFO L858 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,491 INFO L858 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,491 INFO L858 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,491 INFO L858 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,491 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:40:11,491 INFO L858 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-02-20 14:40:11,492 INFO L858 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,492 INFO L858 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-02-20 14:40:11,492 INFO L861 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-02-20 14:40:11,492 INFO L858 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,492 INFO L858 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-02-20 14:40:11,496 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:11,498 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:40:11,500 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-02-20 14:40:11,501 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-02-20 14:40:11,502 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-02-20 14:40:11,503 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-02-20 14:40:11,504 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-02-20 14:40:11,505 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-02-20 14:40:11,505 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 14:40:11,505 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 14:40:11,505 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 14:40:11,505 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 14:40:11,505 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 14:40:11,505 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 14:40:11,505 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:40:11,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:40:11 BoogieIcfgContainer [2022-02-20 14:40:11,512 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:40:11,512 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:40:11,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:40:11,513 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:40:11,513 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:54" (3/4) ... [2022-02-20 14:40:11,515 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:40:11,525 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 14:40:11,525 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 14:40:11,525 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:40:11,525 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:40:11,561 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:40:11,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:40:11,563 INFO L158 Benchmark]: Toolchain (without parser) took 17215.73ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 58.1MB in the beginning and 194.6MB in the end (delta: -136.5MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-02-20 14:40:11,564 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 90.2MB. Free memory was 47.6MB in the beginning and 47.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:40:11,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.84ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 57.9MB in the beginning and 84.1MB in the end (delta: -26.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:40:11,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.69ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 82.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:40:11,564 INFO L158 Benchmark]: Boogie Preprocessor took 25.74ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 81.1MB in the end (delta: 911.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:40:11,564 INFO L158 Benchmark]: RCFGBuilder took 332.05ms. Allocated memory is still 109.1MB. Free memory was 81.1MB in the beginning and 66.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 14:40:11,565 INFO L158 Benchmark]: TraceAbstraction took 16538.10ms. Allocated memory was 109.1MB in the beginning and 232.8MB in the end (delta: 123.7MB). Free memory was 65.7MB in the beginning and 197.8MB in the end (delta: -132.0MB). Peak memory consumption was 125.6MB. Max. memory is 16.1GB. [2022-02-20 14:40:11,565 INFO L158 Benchmark]: Witness Printer took 49.46ms. Allocated memory is still 232.8MB. Free memory was 197.8MB in the beginning and 194.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:40:11,566 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.15ms. Allocated memory is still 90.2MB. Free memory was 47.6MB in the beginning and 47.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.84ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 57.9MB in the beginning and 84.1MB in the end (delta: -26.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.69ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 82.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.74ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 81.1MB in the end (delta: 911.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 332.05ms. Allocated memory is still 109.1MB. Free memory was 81.1MB in the beginning and 66.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16538.10ms. Allocated memory was 109.1MB in the beginning and 232.8MB in the end (delta: 123.7MB). Free memory was 65.7MB in the beginning and 197.8MB in the end (delta: -132.0MB). Peak memory consumption was 125.6MB. Max. memory is 16.1GB. * Witness Printer took 49.46ms. Allocated memory is still 232.8MB. Free memory was 197.8MB in the beginning and 194.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 964 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1474 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 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.5s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 389 ConstructedInterpolants, 0 QuantifiedInterpolants, 805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 14:40:11,596 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