./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_7.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_7.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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:39:51,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:39:51,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:39:51,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:39:51,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:39:51,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:39:51,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:39:51,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:39:51,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:39:51,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:39:51,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:39:51,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:39:51,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:39:51,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:39:51,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:39:51,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:39:51,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:39:51,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:39:51,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:39:51,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:39:51,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:39:51,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:39:51,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:39:51,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:39:51,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:39:51,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:39:51,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:39:51,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:39:51,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:39:51,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:39:51,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:39:51,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:39:51,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:39:51,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:39:51,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:39:51,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:39:51,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:39:51,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:39:51,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:39:51,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:39:51,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:39:51,644 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:51,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:39:51,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:39:51,668 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:39:51,668 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:39:51,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:39:51,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:39:51,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:39:51,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:39:51,669 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:39:51,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:39:51,670 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:39:51,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:39:51,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:39:51,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:39:51,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:39:51,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:39:51,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:39:51,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:39:51,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:39:51,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:39:51,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:39:51,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:39:51,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:39:51,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:39:51,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:51,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:39:51,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:39:51,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:39:51,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:39:51,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:39:51,673 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:39:51,673 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:39:51,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:39:51,673 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2022-02-20 14:39:51,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:39:51,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:39:51,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:39:51,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:39:51,886 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:39:51,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2022-02-20 14:39:51,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4427fef/39da3f2c9f0e428a91a689980234c9bf/FLAG25463afd5 [2022-02-20 14:39:52,319 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:39:52,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2022-02-20 14:39:52,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4427fef/39da3f2c9f0e428a91a689980234c9bf/FLAG25463afd5 [2022-02-20 14:39:52,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4427fef/39da3f2c9f0e428a91a689980234c9bf [2022-02-20 14:39:52,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:39:52,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:39:52,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:52,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:39:52,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:39:52,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:52" (1/1) ... [2022-02-20 14:39:52,348 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:52, skipping insertion in model container [2022-02-20 14:39:52,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:52" (1/1) ... [2022-02-20 14:39:52,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:39:52,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:39:52,489 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_7.c[2881,2894] [2022-02-20 14:39:52,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:52,498 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:39:52,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-02-20 14:39:52,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:52,525 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:39:52,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:52 WrapperNode [2022-02-20 14:39:52,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:52,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:52,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:39:52,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:39:52,537 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:52" (1/1) ... [2022-02-20 14:39:52,541 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:52" (1/1) ... [2022-02-20 14:39:52,570 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 105 [2022-02-20 14:39:52,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:52,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:39:52,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:39:52,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:39:52,577 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:52" (1/1) ... [2022-02-20 14:39:52,577 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:52" (1/1) ... [2022-02-20 14:39:52,586 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:52" (1/1) ... [2022-02-20 14:39:52,587 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:52" (1/1) ... [2022-02-20 14:39:52,593 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:52" (1/1) ... [2022-02-20 14:39:52,602 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:52" (1/1) ... [2022-02-20 14:39:52,603 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:52" (1/1) ... [2022-02-20 14:39:52,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:39:52,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:39:52,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:39:52,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:39:52,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:52" (1/1) ... [2022-02-20 14:39:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:52,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:39:52,636 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:52,637 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:52,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:39:52,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:39:52,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:39:52,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:39:52,704 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:39:52,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:39:52,946 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:39:52,951 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:39:52,951 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:39:52,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:52 BoogieIcfgContainer [2022-02-20 14:39:52,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:39:52,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:39:52,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:39:52,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:39:52,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:39:52" (1/3) ... [2022-02-20 14:39:52,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673d59df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:52, skipping insertion in model container [2022-02-20 14:39:52,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:52" (2/3) ... [2022-02-20 14:39:52,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673d59df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:52, skipping insertion in model container [2022-02-20 14:39:52,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:52" (3/3) ... [2022-02-20 14:39:52,967 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-02-20 14:39:52,972 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:39:52,972 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:39:53,024 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:39:53,030 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:53,031 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:39:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:39:53,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:53,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:53,064 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:53,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:53,070 INFO L85 PathProgramCache]: Analyzing trace with hash -882170869, now seen corresponding path program 1 times [2022-02-20 14:39:53,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:53,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751579272] [2022-02-20 14:39:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:53,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:53,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#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); {34#true} is VALID [2022-02-20 14:39:53,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#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_~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_~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;havoc main_~cond~0#1; {34#true} is VALID [2022-02-20 14:39:53,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {34#true} is VALID [2022-02-20 14:39:53,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#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; {34#true} is VALID [2022-02-20 14:39:53,283 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:53,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:53,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:53,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:53,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:53,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:53,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:53,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:53,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {35#false} is VALID [2022-02-20 14:39:53,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-02-20 14:39:53,291 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:53,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:53,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751579272] [2022-02-20 14:39:53,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751579272] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:53,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:53,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:53,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272989654] [2022-02-20 14:39:53,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:53,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:53,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:53,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:53,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:53,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:53,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:53,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:53,357 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,479 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2022-02-20 14:39:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:53,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 14:39:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 14:39:53,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2022-02-20 14:39:53,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:53,627 INFO L225 Difference]: With dead ends: 65 [2022-02-20 14:39:53,627 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 14:39:53,629 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:53,631 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 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:53,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 103 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:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 14:39:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2022-02-20 14:39:53,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:53,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,673 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,674 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,686 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2022-02-20 14:39:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2022-02-20 14:39:53,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:53,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:53,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 14:39:53,688 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 14:39:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,691 INFO L93 Difference]: Finished difference Result 51 states and 89 transitions. [2022-02-20 14:39:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2022-02-20 14:39:53,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:53,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:53,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:53,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-02-20 14:39:53,698 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 14 [2022-02-20 14:39:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:53,699 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2022-02-20 14:39:53,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,699 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2022-02-20 14:39:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:39:53,700 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:53,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:53,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:39:53,700 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:53,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1275197879, now seen corresponding path program 1 times [2022-02-20 14:39:53,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:53,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976073648] [2022-02-20 14:39:53,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:53,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:53,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#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); {254#true} is VALID [2022-02-20 14:39:53,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#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_~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_~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;havoc main_~cond~0#1; {254#true} is VALID [2022-02-20 14:39:53,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {254#true} is VALID [2022-02-20 14:39:53,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {254#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; {254#true} is VALID [2022-02-20 14:39:53,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {254#true} assume !(0 != main_~p1~0#1); {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:53,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:53,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:53,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:53,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:53,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:53,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:53,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {255#false} is VALID [2022-02-20 14:39:53,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {255#false} assume 1 != main_~lk1~0#1; {255#false} is VALID [2022-02-20 14:39:53,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-02-20 14:39:53,771 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:53,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:53,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976073648] [2022-02-20 14:39:53,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976073648] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:53,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:53,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:53,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072634221] [2022-02-20 14:39:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:53,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:53,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:53,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:53,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:53,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:53,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:53,786 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,849 INFO L93 Difference]: Finished difference Result 84 states and 149 transitions. [2022-02-20 14:39:53,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-20 14:39:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-20 14:39:53,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2022-02-20 14:39:53,962 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:39:53,965 INFO L225 Difference]: With dead ends: 84 [2022-02-20 14:39:53,966 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 14:39:53,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:53,972 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 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:53,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 101 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:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 14:39:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-02-20 14:39:53,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:53,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,985 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,986 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,992 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. [2022-02-20 14:39:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2022-02-20 14:39:53,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:53,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:53,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 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 51 states. [2022-02-20 14:39:53,994 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 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 51 states. [2022-02-20 14:39:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,999 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. [2022-02-20 14:39:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2022-02-20 14:39:54,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:54,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2022-02-20 14:39:54,017 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 86 transitions. Word has length 14 [2022-02-20 14:39:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:54,018 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 86 transitions. [2022-02-20 14:39:54,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 86 transitions. [2022-02-20 14:39:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:54,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:54,021 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:54,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:39:54,023 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1577278843, now seen corresponding path program 1 times [2022-02-20 14:39:54,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:54,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971265307] [2022-02-20 14:39:54,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:54,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#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); {503#true} is VALID [2022-02-20 14:39:54,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#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_~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_~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;havoc main_~cond~0#1; {503#true} is VALID [2022-02-20 14:39:54,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {503#true} is VALID [2022-02-20 14:39:54,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {503#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; {503#true} is VALID [2022-02-20 14:39:54,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {503#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:54,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:54,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:54,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:54,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:54,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:54,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:54,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {504#false} is VALID [2022-02-20 14:39:54,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {504#false} assume 0 != main_~p2~0#1; {504#false} is VALID [2022-02-20 14:39:54,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {504#false} assume 1 != main_~lk2~0#1; {504#false} is VALID [2022-02-20 14:39:54,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#false} assume !false; {504#false} is VALID [2022-02-20 14:39:54,082 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:54,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:54,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971265307] [2022-02-20 14:39:54,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971265307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:54,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:54,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:54,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639937445] [2022-02-20 14:39:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:54,086 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:54,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:54,086 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:54,096 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:54,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:54,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:54,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:54,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:54,098 INFO L87 Difference]: Start difference. First operand 49 states and 86 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:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,164 INFO L93 Difference]: Finished difference Result 78 states and 132 transitions. [2022-02-20 14:39:54,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:54,166 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:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:54,168 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:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 14:39:54,171 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:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 14:39:54,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 14:39:54,252 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:39:54,256 INFO L225 Difference]: With dead ends: 78 [2022-02-20 14:39:54,256 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 14:39:54,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:54,257 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 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:54,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 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:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 14:39:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-02-20 14:39:54,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:54,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,261 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,261 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,262 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2022-02-20 14:39:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 89 transitions. [2022-02-20 14:39:54,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 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 54 states. [2022-02-20 14:39:54,263 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 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 54 states. [2022-02-20 14:39:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,265 INFO L93 Difference]: Finished difference Result 54 states and 89 transitions. [2022-02-20 14:39:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 89 transitions. [2022-02-20 14:39:54,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:54,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 88 transitions. [2022-02-20 14:39:54,267 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 88 transitions. Word has length 15 [2022-02-20 14:39:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:54,267 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 88 transitions. [2022-02-20 14:39:54,267 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:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2022-02-20 14:39:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:54,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:54,268 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:54,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:39:54,268 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:54,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:54,269 INFO L85 PathProgramCache]: Analyzing trace with hash -876214265, now seen corresponding path program 1 times [2022-02-20 14:39:54,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:54,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936296287] [2022-02-20 14:39:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:54,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:54,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#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); {757#true} is VALID [2022-02-20 14:39:54,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#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_~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_~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;havoc main_~cond~0#1; {757#true} is VALID [2022-02-20 14:39:54,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {757#true} is VALID [2022-02-20 14:39:54,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {757#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; {757#true} is VALID [2022-02-20 14:39:54,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {757#true} assume !(0 != main_~p1~0#1); {757#true} is VALID [2022-02-20 14:39:54,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:54,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:54,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:54,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:54,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:54,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:54,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:54,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:54,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {759#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {758#false} is VALID [2022-02-20 14:39:54,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-02-20 14:39:54,316 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:54,316 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:54,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936296287] [2022-02-20 14:39:54,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936296287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:54,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:54,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:54,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346683960] [2022-02-20 14:39:54,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:54,317 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:54,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:54,317 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:54,326 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:54,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:54,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:54,327 INFO L87 Difference]: Start difference. First operand 52 states and 88 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:54,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,372 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. [2022-02-20 14:39:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:54,372 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:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:54,372 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:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 14:39:54,373 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:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 14:39:54,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-02-20 14:39:54,423 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:54,425 INFO L225 Difference]: With dead ends: 97 [2022-02-20 14:39:54,425 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 14:39:54,425 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:54,433 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 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:54,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 89 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:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 14:39:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2022-02-20 14:39:54,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:54,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,444 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,444 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,446 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2022-02-20 14:39:54,446 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 162 transitions. [2022-02-20 14:39:54,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 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 95 states. [2022-02-20 14:39:54,447 INFO L87 Difference]: Start difference. First operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 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 95 states. [2022-02-20 14:39:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,450 INFO L93 Difference]: Finished difference Result 95 states and 162 transitions. [2022-02-20 14:39:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 162 transitions. [2022-02-20 14:39:54,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:54,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 117 transitions. [2022-02-20 14:39:54,453 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 117 transitions. Word has length 15 [2022-02-20 14:39:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:54,453 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 117 transitions. [2022-02-20 14:39:54,453 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:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 117 transitions. [2022-02-20 14:39:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:54,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:54,457 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:54,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:39:54,457 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:54,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:54,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1269241275, now seen corresponding path program 1 times [2022-02-20 14:39:54,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:54,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811902086] [2022-02-20 14:39:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:54,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {1130#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); {1130#true} is VALID [2022-02-20 14:39:54,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1130#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_~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_~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;havoc main_~cond~0#1; {1130#true} is VALID [2022-02-20 14:39:54,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {1130#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1130#true} is VALID [2022-02-20 14:39:54,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {1130#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; {1130#true} is VALID [2022-02-20 14:39:54,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {1130#true} assume !(0 != main_~p1~0#1); {1130#true} is VALID [2022-02-20 14:39:54,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {1130#true} assume !(0 != main_~p2~0#1); {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:54,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:54,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:54,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:54,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:54,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:54,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:54,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {1132#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1131#false} is VALID [2022-02-20 14:39:54,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {1131#false} assume 1 != main_~lk2~0#1; {1131#false} is VALID [2022-02-20 14:39:54,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {1131#false} assume !false; {1131#false} is VALID [2022-02-20 14:39:54,502 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:54,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:54,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811902086] [2022-02-20 14:39:54,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811902086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:54,502 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:54,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:54,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190306976] [2022-02-20 14:39:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:54,502 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:54,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:54,502 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:54,511 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:54,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:54,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:54,512 INFO L87 Difference]: Start difference. First operand 69 states and 117 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:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,573 INFO L93 Difference]: Finished difference Result 161 states and 275 transitions. [2022-02-20 14:39:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:54,574 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:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:54,574 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:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-20 14:39:54,575 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:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-20 14:39:54,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2022-02-20 14:39:54,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:54,661 INFO L225 Difference]: With dead ends: 161 [2022-02-20 14:39:54,661 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 14:39:54,662 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:54,662 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 102 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:54,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 102 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:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 14:39:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-02-20 14:39:54,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:54,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,666 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,667 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,668 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2022-02-20 14:39:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 160 transitions. [2022-02-20 14:39:54,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 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 97 states. [2022-02-20 14:39:54,669 INFO L87 Difference]: Start difference. First operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 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 97 states. [2022-02-20 14:39:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,671 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2022-02-20 14:39:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 160 transitions. [2022-02-20 14:39:54,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:54,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:54,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 159 transitions. [2022-02-20 14:39:54,674 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 159 transitions. Word has length 15 [2022-02-20 14:39:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:54,674 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 159 transitions. [2022-02-20 14:39:54,674 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:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 159 transitions. [2022-02-20 14:39:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:54,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:54,674 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:54,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:39:54,674 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1392623778, now seen corresponding path program 1 times [2022-02-20 14:39:54,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:54,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511493062] [2022-02-20 14:39:54,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:54,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:54,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {1601#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); {1601#true} is VALID [2022-02-20 14:39:54,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1601#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_~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_~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;havoc main_~cond~0#1; {1601#true} is VALID [2022-02-20 14:39:54,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1601#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {1601#true} is VALID [2022-02-20 14:39:54,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {1601#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; {1601#true} is VALID [2022-02-20 14:39:54,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {1601#true} assume !(0 != main_~p1~0#1); {1601#true} is VALID [2022-02-20 14:39:54,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {1601#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:54,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:54,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:54,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:54,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:54,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:54,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:54,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1603#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {1602#false} is VALID [2022-02-20 14:39:54,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {1602#false} assume 0 != main_~p3~0#1; {1602#false} is VALID [2022-02-20 14:39:54,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1602#false} assume 1 != main_~lk3~0#1; {1602#false} is VALID [2022-02-20 14:39:54,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {1602#false} assume !false; {1602#false} is VALID [2022-02-20 14:39:54,732 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:54,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:54,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511493062] [2022-02-20 14:39:54,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511493062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:54,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:54,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:54,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225018027] [2022-02-20 14:39:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:54,733 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:54,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:54,733 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:54,742 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:54,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:54,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:54,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:54,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:54,743 INFO L87 Difference]: Start difference. First operand 95 states and 159 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:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,789 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2022-02-20 14:39:54,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:54,789 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:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:54,789 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:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-20 14:39:54,790 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:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-20 14:39:54,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2022-02-20 14:39:54,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:54,855 INFO L225 Difference]: With dead ends: 144 [2022-02-20 14:39:54,855 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 14:39:54,855 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:54,856 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 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:39:54,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 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:39:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 14:39:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-02-20 14:39:54,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:54,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,859 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,859 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,861 INFO L93 Difference]: Finished difference Result 99 states and 160 transitions. [2022-02-20 14:39:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2022-02-20 14:39:54,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 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 99 states. [2022-02-20 14:39:54,862 INFO L87 Difference]: Start difference. First operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 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 99 states. [2022-02-20 14:39:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,864 INFO L93 Difference]: Finished difference Result 99 states and 160 transitions. [2022-02-20 14:39:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 160 transitions. [2022-02-20 14:39:54,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:54,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2022-02-20 14:39:54,866 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 16 [2022-02-20 14:39:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:54,866 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2022-02-20 14:39:54,866 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:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2022-02-20 14:39:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:54,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:54,866 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:54,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:39:54,867 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:54,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:54,867 INFO L85 PathProgramCache]: Analyzing trace with hash -691559200, now seen corresponding path program 1 times [2022-02-20 14:39:54,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:54,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047251434] [2022-02-20 14:39:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:54,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:54,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {2061#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); {2061#true} is VALID [2022-02-20 14:39:54,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {2061#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_~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_~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;havoc main_~cond~0#1; {2061#true} is VALID [2022-02-20 14:39:54,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {2061#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2061#true} is VALID [2022-02-20 14:39:54,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {2061#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; {2061#true} is VALID [2022-02-20 14:39:54,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {2061#true} assume !(0 != main_~p1~0#1); {2061#true} is VALID [2022-02-20 14:39:54,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {2061#true} assume !(0 != main_~p2~0#1); {2061#true} is VALID [2022-02-20 14:39:54,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {2061#true} assume !(0 != main_~p3~0#1); {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:54,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:54,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:54,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:54,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:54,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:54,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:54,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {2063#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {2062#false} is VALID [2022-02-20 14:39:54,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {2062#false} assume 1 != main_~lk3~0#1; {2062#false} is VALID [2022-02-20 14:39:54,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {2062#false} assume !false; {2062#false} is VALID [2022-02-20 14:39:54,910 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:54,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:54,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047251434] [2022-02-20 14:39:54,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047251434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:54,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:54,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:54,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431215700] [2022-02-20 14:39:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:54,910 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:54,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:54,911 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:54,919 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:54,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:54,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:54,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:54,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:54,920 INFO L87 Difference]: Start difference. First operand 97 states and 159 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:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,964 INFO L93 Difference]: Finished difference Result 273 states and 449 transitions. [2022-02-20 14:39:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:54,964 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:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:54,965 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:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 14:39:54,967 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:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 14:39:54,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 14:39:55,027 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:39:55,029 INFO L225 Difference]: With dead ends: 273 [2022-02-20 14:39:55,029 INFO L226 Difference]: Without dead ends: 183 [2022-02-20 14:39:55,031 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,032 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 91 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,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 91 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,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-20 14:39:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2022-02-20 14:39:55,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 180 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (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,047 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 180 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (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,047 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 180 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (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,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,051 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2022-02-20 14:39:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 292 transitions. [2022-02-20 14:39:55,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 180 states have internal predecessors, (291), 0 states have call successors, (0), 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 183 states. [2022-02-20 14:39:55,052 INFO L87 Difference]: Start difference. First operand has 181 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 180 states have internal predecessors, (291), 0 states have call successors, (0), 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 183 states. [2022-02-20 14:39:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,056 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2022-02-20 14:39:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 292 transitions. [2022-02-20 14:39:55,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:55,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 180 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (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,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 291 transitions. [2022-02-20 14:39:55,060 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 291 transitions. Word has length 16 [2022-02-20 14:39:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:55,061 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 291 transitions. [2022-02-20 14:39:55,061 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:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 291 transitions. [2022-02-20 14:39:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:55,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:55,062 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:55,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:39:55,062 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:55,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash -298532190, now seen corresponding path program 1 times [2022-02-20 14:39:55,063 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:55,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816037034] [2022-02-20 14:39:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:55,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {2912#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); {2912#true} is VALID [2022-02-20 14:39:55,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {2912#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_~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_~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;havoc main_~cond~0#1; {2912#true} is VALID [2022-02-20 14:39:55,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {2912#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {2912#true} is VALID [2022-02-20 14:39:55,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {2912#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; {2912#true} is VALID [2022-02-20 14:39:55,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {2912#true} assume !(0 != main_~p1~0#1); {2912#true} is VALID [2022-02-20 14:39:55,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {2912#true} assume !(0 != main_~p2~0#1); {2912#true} is VALID [2022-02-20 14:39:55,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {2912#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:55,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:55,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:55,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:55,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:55,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:55,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:55,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:55,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {2914#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {2913#false} is VALID [2022-02-20 14:39:55,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {2913#false} assume !false; {2913#false} is VALID [2022-02-20 14:39:55,122 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,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:55,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816037034] [2022-02-20 14:39:55,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816037034] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:55,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:55,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:55,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716383023] [2022-02-20 14:39:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:55,123 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:55,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:55,123 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:55,131 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:55,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:55,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:55,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:55,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:55,132 INFO L87 Difference]: Start difference. First operand 181 states and 291 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:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,203 INFO L93 Difference]: Finished difference Result 225 states and 365 transitions. [2022-02-20 14:39:55,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:55,203 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:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:55,203 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:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-02-20 14:39:55,204 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:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-02-20 14:39:55,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2022-02-20 14:39:55,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:55,251 INFO L225 Difference]: With dead ends: 225 [2022-02-20 14:39:55,251 INFO L226 Difference]: Without dead ends: 223 [2022-02-20 14:39:55,251 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,252 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 116 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:55,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 116 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:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-02-20 14:39:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 181. [2022-02-20 14:39:55,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (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,257 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (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,257 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (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,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,261 INFO L93 Difference]: Finished difference Result 223 states and 360 transitions. [2022-02-20 14:39:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 360 transitions. [2022-02-20 14:39:55,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 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 223 states. [2022-02-20 14:39:55,263 INFO L87 Difference]: Start difference. First operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 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 223 states. [2022-02-20 14:39:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,284 INFO L93 Difference]: Finished difference Result 223 states and 360 transitions. [2022-02-20 14:39:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 360 transitions. [2022-02-20 14:39:55,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:55,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (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,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 287 transitions. [2022-02-20 14:39:55,289 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 287 transitions. Word has length 16 [2022-02-20 14:39:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:55,289 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 287 transitions. [2022-02-20 14:39:55,289 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:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 287 transitions. [2022-02-20 14:39:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:55,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:55,290 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:55,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:39:55,290 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:55,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:55,290 INFO L85 PathProgramCache]: Analyzing trace with hash 36716282, now seen corresponding path program 1 times [2022-02-20 14:39:55,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:55,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004682904] [2022-02-20 14:39:55,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:55,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:55,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {3795#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); {3795#true} is VALID [2022-02-20 14:39:55,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {3795#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_~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_~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;havoc main_~cond~0#1; {3795#true} is VALID [2022-02-20 14:39:55,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {3795#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {3795#true} is VALID [2022-02-20 14:39:55,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {3795#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; {3795#true} is VALID [2022-02-20 14:39:55,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {3795#true} assume !(0 != main_~p1~0#1); {3795#true} is VALID [2022-02-20 14:39:55,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {3795#true} assume !(0 != main_~p2~0#1); {3795#true} is VALID [2022-02-20 14:39:55,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {3795#true} assume !(0 != main_~p3~0#1); {3795#true} is VALID [2022-02-20 14:39:55,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {3795#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:55,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:55,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:55,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:55,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:55,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:55,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:55,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:55,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {3797#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {3796#false} is VALID [2022-02-20 14:39:55,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {3796#false} assume !false; {3796#false} is VALID [2022-02-20 14:39:55,315 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,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:55,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004682904] [2022-02-20 14:39:55,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004682904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:55,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:55,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:55,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090734200] [2022-02-20 14:39:55,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:55,315 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:55,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:55,315 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:55,325 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:55,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:55,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:55,326 INFO L87 Difference]: Start difference. First operand 181 states and 287 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:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,368 INFO L93 Difference]: Finished difference Result 325 states and 521 transitions. [2022-02-20 14:39:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:55,368 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:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:55,368 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:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-02-20 14:39:55,369 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:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-02-20 14:39:55,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 79 transitions. [2022-02-20 14:39:55,413 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:39:55,418 INFO L225 Difference]: With dead ends: 325 [2022-02-20 14:39:55,419 INFO L226 Difference]: Without dead ends: 323 [2022-02-20 14:39:55,419 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,421 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 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,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 85 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,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-02-20 14:39:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 257. [2022-02-20 14:39:55,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 257 states, 256 states have (on average 1.55859375) internal successors, (399), 256 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (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,427 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 257 states, 256 states have (on average 1.55859375) internal successors, (399), 256 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (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,427 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 257 states, 256 states have (on average 1.55859375) internal successors, (399), 256 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (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,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,437 INFO L93 Difference]: Finished difference Result 323 states and 512 transitions. [2022-02-20 14:39:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 512 transitions. [2022-02-20 14:39:55,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 256 states have (on average 1.55859375) internal successors, (399), 256 states have internal predecessors, (399), 0 states have call successors, (0), 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 323 states. [2022-02-20 14:39:55,439 INFO L87 Difference]: Start difference. First operand has 257 states, 256 states have (on average 1.55859375) internal successors, (399), 256 states have internal predecessors, (399), 0 states have call successors, (0), 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 323 states. [2022-02-20 14:39:55,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,444 INFO L93 Difference]: Finished difference Result 323 states and 512 transitions. [2022-02-20 14:39:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 512 transitions. [2022-02-20 14:39:55,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:55,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.55859375) internal successors, (399), 256 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (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,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 399 transitions. [2022-02-20 14:39:55,449 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 399 transitions. Word has length 17 [2022-02-20 14:39:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:55,449 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 399 transitions. [2022-02-20 14:39:55,449 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:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 399 transitions. [2022-02-20 14:39:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:55,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:55,450 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:55,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:39:55,450 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash -356310728, now seen corresponding path program 1 times [2022-02-20 14:39:55,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:55,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506133713] [2022-02-20 14:39:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:55,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {5058#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); {5058#true} is VALID [2022-02-20 14:39:55,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {5058#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_~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_~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;havoc main_~cond~0#1; {5058#true} is VALID [2022-02-20 14:39:55,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {5058#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {5058#true} is VALID [2022-02-20 14:39:55,479 INFO L290 TraceCheckUtils]: 3: Hoare triple {5058#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; {5058#true} is VALID [2022-02-20 14:39:55,479 INFO L290 TraceCheckUtils]: 4: Hoare triple {5058#true} assume !(0 != main_~p1~0#1); {5058#true} is VALID [2022-02-20 14:39:55,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {5058#true} assume !(0 != main_~p2~0#1); {5058#true} is VALID [2022-02-20 14:39:55,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {5058#true} assume !(0 != main_~p3~0#1); {5058#true} is VALID [2022-02-20 14:39:55,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {5058#true} assume !(0 != main_~p4~0#1); {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:55,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:55,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:55,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:55,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:55,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:55,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:55,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {5060#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {5059#false} is VALID [2022-02-20 14:39:55,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {5059#false} assume 1 != main_~lk4~0#1; {5059#false} is VALID [2022-02-20 14:39:55,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {5059#false} assume !false; {5059#false} is VALID [2022-02-20 14:39:55,484 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,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:55,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506133713] [2022-02-20 14:39:55,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506133713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:55,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:55,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:55,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726857284] [2022-02-20 14:39:55,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:55,486 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:55,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:55,487 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:55,496 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:55,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:55,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:55,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:55,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:55,497 INFO L87 Difference]: Start difference. First operand 257 states and 399 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:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,553 INFO L93 Difference]: Finished difference Result 597 states and 929 transitions. [2022-02-20 14:39:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:55,553 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:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:55,553 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:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-20 14:39:55,554 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:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-20 14:39:55,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2022-02-20 14:39:55,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:55,623 INFO L225 Difference]: With dead ends: 597 [2022-02-20 14:39:55,624 INFO L226 Difference]: Without dead ends: 347 [2022-02-20 14:39:55,624 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,625 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 104 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,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 104 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,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-02-20 14:39:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2022-02-20 14:39:55,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 345 states, 344 states have (on average 1.5203488372093024) internal successors, (523), 344 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (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,632 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 345 states, 344 states have (on average 1.5203488372093024) internal successors, (523), 344 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (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,632 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 345 states, 344 states have (on average 1.5203488372093024) internal successors, (523), 344 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (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,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,638 INFO L93 Difference]: Finished difference Result 347 states and 524 transitions. [2022-02-20 14:39:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 524 transitions. [2022-02-20 14:39:55,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 344 states have (on average 1.5203488372093024) internal successors, (523), 344 states have internal predecessors, (523), 0 states have call successors, (0), 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 347 states. [2022-02-20 14:39:55,639 INFO L87 Difference]: Start difference. First operand has 345 states, 344 states have (on average 1.5203488372093024) internal successors, (523), 344 states have internal predecessors, (523), 0 states have call successors, (0), 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 347 states. [2022-02-20 14:39:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,647 INFO L93 Difference]: Finished difference Result 347 states and 524 transitions. [2022-02-20 14:39:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 524 transitions. [2022-02-20 14:39:55,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:55,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.5203488372093024) internal successors, (523), 344 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (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,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 523 transitions. [2022-02-20 14:39:55,656 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 523 transitions. Word has length 17 [2022-02-20 14:39:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:55,656 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 523 transitions. [2022-02-20 14:39:55,656 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:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 523 transitions. [2022-02-20 14:39:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:55,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:55,657 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:55,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:39:55,658 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1138420085, now seen corresponding path program 1 times [2022-02-20 14:39:55,658 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:55,658 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632161667] [2022-02-20 14:39:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:55,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {6745#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); {6745#true} is VALID [2022-02-20 14:39:55,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {6745#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_~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_~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;havoc main_~cond~0#1; {6745#true} is VALID [2022-02-20 14:39:55,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {6745#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {6745#true} is VALID [2022-02-20 14:39:55,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {6745#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; {6745#true} is VALID [2022-02-20 14:39:55,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {6745#true} assume !(0 != main_~p1~0#1); {6745#true} is VALID [2022-02-20 14:39:55,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {6745#true} assume !(0 != main_~p2~0#1); {6745#true} is VALID [2022-02-20 14:39:55,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {6745#true} assume !(0 != main_~p3~0#1); {6745#true} is VALID [2022-02-20 14:39:55,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {6745#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:55,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:55,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:55,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:55,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:55,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:55,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:55,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {6747#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {6746#false} is VALID [2022-02-20 14:39:55,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {6746#false} assume 0 != main_~p5~0#1; {6746#false} is VALID [2022-02-20 14:39:55,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {6746#false} assume 1 != main_~lk5~0#1; {6746#false} is VALID [2022-02-20 14:39:55,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {6746#false} assume !false; {6746#false} is VALID [2022-02-20 14:39:55,681 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,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:55,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632161667] [2022-02-20 14:39:55,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632161667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:55,681 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:55,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:55,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319157281] [2022-02-20 14:39:55,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:55,682 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:55,682 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:55,682 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:55,691 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:55,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:55,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:55,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:55,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:55,692 INFO L87 Difference]: Start difference. First operand 345 states and 523 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:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,742 INFO L93 Difference]: Finished difference Result 525 states and 793 transitions. [2022-02-20 14:39:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:55,743 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:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:55,743 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:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2022-02-20 14:39:55,744 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:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2022-02-20 14:39:55,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2022-02-20 14:39:55,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:55,807 INFO L225 Difference]: With dead ends: 525 [2022-02-20 14:39:55,807 INFO L226 Difference]: Without dead ends: 359 [2022-02-20 14:39:55,808 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,808 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 100 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:55,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 100 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:55,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-02-20 14:39:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-02-20 14:39:55,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 357 states, 356 states have (on average 1.4915730337078652) internal successors, (531), 356 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (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,816 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 357 states, 356 states have (on average 1.4915730337078652) internal successors, (531), 356 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (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,816 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 357 states, 356 states have (on average 1.4915730337078652) internal successors, (531), 356 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (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,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,824 INFO L93 Difference]: Finished difference Result 359 states and 532 transitions. [2022-02-20 14:39:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 532 transitions. [2022-02-20 14:39:55,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 356 states have (on average 1.4915730337078652) internal successors, (531), 356 states have internal predecessors, (531), 0 states have call successors, (0), 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 359 states. [2022-02-20 14:39:55,826 INFO L87 Difference]: Start difference. First operand has 357 states, 356 states have (on average 1.4915730337078652) internal successors, (531), 356 states have internal predecessors, (531), 0 states have call successors, (0), 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 359 states. [2022-02-20 14:39:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,834 INFO L93 Difference]: Finished difference Result 359 states and 532 transitions. [2022-02-20 14:39:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 532 transitions. [2022-02-20 14:39:55,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:55,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.4915730337078652) internal successors, (531), 356 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (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,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 531 transitions. [2022-02-20 14:39:55,842 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 531 transitions. Word has length 18 [2022-02-20 14:39:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:55,842 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 531 transitions. [2022-02-20 14:39:55,843 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:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 531 transitions. [2022-02-20 14:39:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:55,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:55,843 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:55,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:39:55,844 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:55,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1839484663, now seen corresponding path program 1 times [2022-02-20 14:39:55,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:55,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125419409] [2022-02-20 14:39:55,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:55,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {8396#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); {8396#true} is VALID [2022-02-20 14:39:55,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {8396#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_~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_~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;havoc main_~cond~0#1; {8396#true} is VALID [2022-02-20 14:39:55,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {8396#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {8396#true} is VALID [2022-02-20 14:39:55,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {8396#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; {8396#true} is VALID [2022-02-20 14:39:55,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {8396#true} assume !(0 != main_~p1~0#1); {8396#true} is VALID [2022-02-20 14:39:55,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {8396#true} assume !(0 != main_~p2~0#1); {8396#true} is VALID [2022-02-20 14:39:55,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {8396#true} assume !(0 != main_~p3~0#1); {8396#true} is VALID [2022-02-20 14:39:55,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {8396#true} assume !(0 != main_~p4~0#1); {8396#true} is VALID [2022-02-20 14:39:55,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {8396#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:55,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:55,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:55,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:55,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:55,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:55,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:55,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:55,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {8398#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {8397#false} is VALID [2022-02-20 14:39:55,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {8397#false} assume !false; {8397#false} is VALID [2022-02-20 14:39:55,868 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,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:55,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125419409] [2022-02-20 14:39:55,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125419409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:55,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:55,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:55,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620932225] [2022-02-20 14:39:55,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:55,869 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:55,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:55,869 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:55,878 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:55,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:55,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:55,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:55,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:55,879 INFO L87 Difference]: Start difference. First operand 357 states and 531 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:55,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,929 INFO L93 Difference]: Finished difference Result 617 states and 925 transitions. [2022-02-20 14:39:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:55,929 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:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:55,929 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:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-02-20 14:39:55,930 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:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-02-20 14:39:55,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2022-02-20 14:39:55,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:55,981 INFO L225 Difference]: With dead ends: 617 [2022-02-20 14:39:55,981 INFO L226 Difference]: Without dead ends: 615 [2022-02-20 14:39:55,982 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,982 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 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,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 83 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,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-02-20 14:39:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 517. [2022-02-20 14:39:55,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 615 states. Second operand has 517 states, 516 states have (on average 1.447674418604651) internal successors, (747), 516 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (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,991 INFO L74 IsIncluded]: Start isIncluded. First operand 615 states. Second operand has 517 states, 516 states have (on average 1.447674418604651) internal successors, (747), 516 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (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,992 INFO L87 Difference]: Start difference. First operand 615 states. Second operand has 517 states, 516 states have (on average 1.447674418604651) internal successors, (747), 516 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (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,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,005 INFO L93 Difference]: Finished difference Result 615 states and 908 transitions. [2022-02-20 14:39:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 908 transitions. [2022-02-20 14:39:56,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 517 states, 516 states have (on average 1.447674418604651) internal successors, (747), 516 states have internal predecessors, (747), 0 states have call successors, (0), 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 615 states. [2022-02-20 14:39:56,007 INFO L87 Difference]: Start difference. First operand has 517 states, 516 states have (on average 1.447674418604651) internal successors, (747), 516 states have internal predecessors, (747), 0 states have call successors, (0), 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 615 states. [2022-02-20 14:39:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,021 INFO L93 Difference]: Finished difference Result 615 states and 908 transitions. [2022-02-20 14:39:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 908 transitions. [2022-02-20 14:39:56,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.447674418604651) internal successors, (747), 516 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (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,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 747 transitions. [2022-02-20 14:39:56,034 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 747 transitions. Word has length 18 [2022-02-20 14:39:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,034 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 747 transitions. [2022-02-20 14:39:56,034 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:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 747 transitions. [2022-02-20 14:39:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:56,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,035 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:56,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:39:56,035 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1446457653, now seen corresponding path program 1 times [2022-02-20 14:39:56,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722564963] [2022-02-20 14:39:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {10819#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); {10819#true} is VALID [2022-02-20 14:39:56,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {10819#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_~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_~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;havoc main_~cond~0#1; {10819#true} is VALID [2022-02-20 14:39:56,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {10819#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {10819#true} is VALID [2022-02-20 14:39:56,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {10819#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; {10819#true} is VALID [2022-02-20 14:39:56,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {10819#true} assume !(0 != main_~p1~0#1); {10819#true} is VALID [2022-02-20 14:39:56,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {10819#true} assume !(0 != main_~p2~0#1); {10819#true} is VALID [2022-02-20 14:39:56,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {10819#true} assume !(0 != main_~p3~0#1); {10819#true} is VALID [2022-02-20 14:39:56,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {10819#true} assume !(0 != main_~p4~0#1); {10819#true} is VALID [2022-02-20 14:39:56,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {10819#true} assume !(0 != main_~p5~0#1); {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:56,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:56,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:56,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:56,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:56,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:56,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:56,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {10821#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {10820#false} is VALID [2022-02-20 14:39:56,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {10820#false} assume 1 != main_~lk5~0#1; {10820#false} is VALID [2022-02-20 14:39:56,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {10820#false} assume !false; {10820#false} is VALID [2022-02-20 14:39:56,058 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,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722564963] [2022-02-20 14:39:56,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722564963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,058 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246247880] [2022-02-20 14:39:56,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,059 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:56,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,059 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:56,072 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:56,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:56,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:56,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:56,073 INFO L87 Difference]: Start difference. First operand 517 states and 747 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:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,158 INFO L93 Difference]: Finished difference Result 1177 states and 1693 transitions. [2022-02-20 14:39:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:56,158 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:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:56,158 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:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-20 14:39:56,159 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:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-20 14:39:56,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2022-02-20 14:39:56,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,229 INFO L225 Difference]: With dead ends: 1177 [2022-02-20 14:39:56,230 INFO L226 Difference]: Without dead ends: 679 [2022-02-20 14:39:56,230 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,232 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 105 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,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 105 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,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-02-20 14:39:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2022-02-20 14:39:56,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:56,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 679 states. Second operand has 677 states, 676 states have (on average 1.400887573964497) internal successors, (947), 676 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (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,251 INFO L74 IsIncluded]: Start isIncluded. First operand 679 states. Second operand has 677 states, 676 states have (on average 1.400887573964497) internal successors, (947), 676 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (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,252 INFO L87 Difference]: Start difference. First operand 679 states. Second operand has 677 states, 676 states have (on average 1.400887573964497) internal successors, (947), 676 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (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,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,267 INFO L93 Difference]: Finished difference Result 679 states and 948 transitions. [2022-02-20 14:39:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 948 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 L74 IsIncluded]: Start isIncluded. First operand has 677 states, 676 states have (on average 1.400887573964497) internal successors, (947), 676 states have internal predecessors, (947), 0 states have call successors, (0), 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 679 states. [2022-02-20 14:39:56,271 INFO L87 Difference]: Start difference. First operand has 677 states, 676 states have (on average 1.400887573964497) internal successors, (947), 676 states have internal predecessors, (947), 0 states have call successors, (0), 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 679 states. [2022-02-20 14:39:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,286 INFO L93 Difference]: Finished difference Result 679 states and 948 transitions. [2022-02-20 14:39:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 948 transitions. [2022-02-20 14:39:56,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.400887573964497) internal successors, (947), 676 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (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,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 947 transitions. [2022-02-20 14:39:56,305 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 947 transitions. Word has length 18 [2022-02-20 14:39:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,305 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 947 transitions. [2022-02-20 14:39:56,305 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:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 947 transitions. [2022-02-20 14:39:56,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:56,306 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,306 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:56,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 14:39:56,307 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1189665389, now seen corresponding path program 1 times [2022-02-20 14:39:56,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682309964] [2022-02-20 14:39:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {14122#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); {14122#true} is VALID [2022-02-20 14:39:56,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {14122#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_~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_~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;havoc main_~cond~0#1; {14122#true} is VALID [2022-02-20 14:39:56,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {14122#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {14122#true} is VALID [2022-02-20 14:39:56,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {14122#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; {14122#true} is VALID [2022-02-20 14:39:56,338 INFO L290 TraceCheckUtils]: 4: Hoare triple {14122#true} assume !(0 != main_~p1~0#1); {14122#true} is VALID [2022-02-20 14:39:56,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {14122#true} assume !(0 != main_~p2~0#1); {14122#true} is VALID [2022-02-20 14:39:56,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {14122#true} assume !(0 != main_~p3~0#1); {14122#true} is VALID [2022-02-20 14:39:56,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {14122#true} assume !(0 != main_~p4~0#1); {14122#true} is VALID [2022-02-20 14:39:56,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {14122#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:56,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:56,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:56,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:56,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:56,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:56,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:56,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {14124#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {14123#false} is VALID [2022-02-20 14:39:56,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {14123#false} assume 0 != main_~p6~0#1; {14123#false} is VALID [2022-02-20 14:39:56,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {14123#false} assume 1 != main_~lk6~0#1; {14123#false} is VALID [2022-02-20 14:39:56,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {14123#false} assume !false; {14123#false} is VALID [2022-02-20 14:39:56,342 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,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682309964] [2022-02-20 14:39:56,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682309964] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907851888] [2022-02-20 14:39:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,343 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:56,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,343 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:56,352 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:56,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:56,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:56,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:56,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:56,353 INFO L87 Difference]: Start difference. First operand 677 states and 947 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:56,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,433 INFO L93 Difference]: Finished difference Result 1017 states and 1413 transitions. [2022-02-20 14:39:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:56,433 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:56,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:56,434 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:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-02-20 14:39:56,434 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:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-02-20 14:39:56,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2022-02-20 14:39:56,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,513 INFO L225 Difference]: With dead ends: 1017 [2022-02-20 14:39:56,513 INFO L226 Difference]: Without dead ends: 695 [2022-02-20 14:39:56,513 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,514 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 96 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,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 96 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,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-02-20 14:39:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2022-02-20 14:39:56,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:56,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (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,525 INFO L74 IsIncluded]: Start isIncluded. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (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,526 INFO L87 Difference]: Start difference. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (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,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,545 INFO L93 Difference]: Finished difference Result 695 states and 948 transitions. [2022-02-20 14:39:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 948 transitions. [2022-02-20 14:39:56,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 0 states have call successors, (0), 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 695 states. [2022-02-20 14:39:56,548 INFO L87 Difference]: Start difference. First operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 0 states have call successors, (0), 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 695 states. [2022-02-20 14:39:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,566 INFO L93 Difference]: Finished difference Result 695 states and 948 transitions. [2022-02-20 14:39:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 948 transitions. [2022-02-20 14:39:56,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (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,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 947 transitions. [2022-02-20 14:39:56,584 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 947 transitions. Word has length 19 [2022-02-20 14:39:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,585 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 947 transitions. [2022-02-20 14:39:56,585 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:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 947 transitions. [2022-02-20 14:39:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:56,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,586 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:56,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 14:39:56,586 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1890729967, now seen corresponding path program 1 times [2022-02-20 14:39:56,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884184645] [2022-02-20 14:39:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {17313#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); {17313#true} is VALID [2022-02-20 14:39:56,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {17313#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_~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_~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;havoc main_~cond~0#1; {17313#true} is VALID [2022-02-20 14:39:56,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {17313#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {17313#true} is VALID [2022-02-20 14:39:56,616 INFO L290 TraceCheckUtils]: 3: Hoare triple {17313#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; {17313#true} is VALID [2022-02-20 14:39:56,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {17313#true} assume !(0 != main_~p1~0#1); {17313#true} is VALID [2022-02-20 14:39:56,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {17313#true} assume !(0 != main_~p2~0#1); {17313#true} is VALID [2022-02-20 14:39:56,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {17313#true} assume !(0 != main_~p3~0#1); {17313#true} is VALID [2022-02-20 14:39:56,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {17313#true} assume !(0 != main_~p4~0#1); {17313#true} is VALID [2022-02-20 14:39:56,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {17313#true} assume !(0 != main_~p5~0#1); {17313#true} is VALID [2022-02-20 14:39:56,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {17313#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:56,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:56,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:56,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:56,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:56,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:56,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:56,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:56,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {17315#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {17314#false} is VALID [2022-02-20 14:39:56,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {17314#false} assume !false; {17314#false} is VALID [2022-02-20 14:39:56,628 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,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884184645] [2022-02-20 14:39:56,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884184645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489766396] [2022-02-20 14:39:56,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,629 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:56,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,629 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:56,638 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:56,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:56,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:56,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:56,639 INFO L87 Difference]: Start difference. First operand 693 states and 947 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:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,715 INFO L93 Difference]: Finished difference Result 1161 states and 1589 transitions. [2022-02-20 14:39:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:56,715 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:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:56,716 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:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-20 14:39:56,716 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:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-20 14:39:56,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-02-20 14:39:56,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:56,786 INFO L225 Difference]: With dead ends: 1161 [2022-02-20 14:39:56,786 INFO L226 Difference]: Without dead ends: 1159 [2022-02-20 14:39:56,788 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,790 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 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,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 81 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,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-02-20 14:39:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1029. [2022-02-20 14:39:56,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:56,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1159 states. Second operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (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,813 INFO L74 IsIncluded]: Start isIncluded. First operand 1159 states. Second operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (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,814 INFO L87 Difference]: Start difference. First operand 1159 states. Second operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (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,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,857 INFO L93 Difference]: Finished difference Result 1159 states and 1556 transitions. [2022-02-20 14:39:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1556 transitions. [2022-02-20 14:39:56,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 0 states have call successors, (0), 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 1159 states. [2022-02-20 14:39:56,861 INFO L87 Difference]: Start difference. First operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 0 states have call successors, (0), 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 1159 states. [2022-02-20 14:39:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,900 INFO L93 Difference]: Finished difference Result 1159 states and 1556 transitions. [2022-02-20 14:39:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1556 transitions. [2022-02-20 14:39:56,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:56,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (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,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1363 transitions. [2022-02-20 14:39:56,937 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1363 transitions. Word has length 19 [2022-02-20 14:39:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:56,937 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1363 transitions. [2022-02-20 14:39:56,937 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:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1363 transitions. [2022-02-20 14:39:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:56,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,940 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:56,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 14:39:56,940 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1497702957, now seen corresponding path program 1 times [2022-02-20 14:39:56,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870990541] [2022-02-20 14:39:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:56,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {21928#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); {21928#true} is VALID [2022-02-20 14:39:56,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {21928#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_~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_~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;havoc main_~cond~0#1; {21928#true} is VALID [2022-02-20 14:39:56,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {21928#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {21928#true} is VALID [2022-02-20 14:39:56,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {21928#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; {21928#true} is VALID [2022-02-20 14:39:56,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {21928#true} assume !(0 != main_~p1~0#1); {21928#true} is VALID [2022-02-20 14:39:56,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {21928#true} assume !(0 != main_~p2~0#1); {21928#true} is VALID [2022-02-20 14:39:56,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {21928#true} assume !(0 != main_~p3~0#1); {21928#true} is VALID [2022-02-20 14:39:56,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {21928#true} assume !(0 != main_~p4~0#1); {21928#true} is VALID [2022-02-20 14:39:56,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {21928#true} assume !(0 != main_~p5~0#1); {21928#true} is VALID [2022-02-20 14:39:56,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {21928#true} assume !(0 != main_~p6~0#1); {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:56,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:56,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:56,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:56,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:56,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:56,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:56,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {21930#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {21929#false} is VALID [2022-02-20 14:39:56,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {21929#false} assume 1 != main_~lk6~0#1; {21929#false} is VALID [2022-02-20 14:39:56,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {21929#false} assume !false; {21929#false} is VALID [2022-02-20 14:39:56,988 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,988 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:56,988 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870990541] [2022-02-20 14:39:56,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870990541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:56,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:56,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:56,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085716710] [2022-02-20 14:39:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:56,990 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:56,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:56,991 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,000 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,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,002 INFO L87 Difference]: Start difference. First operand 1029 states and 1363 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,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,209 INFO L93 Difference]: Finished difference Result 2313 states and 3029 transitions. [2022-02-20 14:39:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,209 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,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,210 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,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-20 14:39:57,210 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,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-20 14:39:57,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2022-02-20 14:39:57,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,311 INFO L225 Difference]: With dead ends: 2313 [2022-02-20 14:39:57,311 INFO L226 Difference]: Without dead ends: 1319 [2022-02-20 14:39:57,313 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,313 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 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,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 106 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,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-02-20 14:39:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1317. [2022-02-20 14:39:57,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1319 states. Second operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (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,338 INFO L74 IsIncluded]: Start isIncluded. First operand 1319 states. Second operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (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,338 INFO L87 Difference]: Start difference. First operand 1319 states. Second operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (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,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,383 INFO L93 Difference]: Finished difference Result 1319 states and 1668 transitions. [2022-02-20 14:39:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1668 transitions. [2022-02-20 14:39:57,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 0 states have call successors, (0), 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 1319 states. [2022-02-20 14:39:57,387 INFO L87 Difference]: Start difference. First operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 0 states have call successors, (0), 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 1319 states. [2022-02-20 14:39:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,433 INFO L93 Difference]: Finished difference Result 1319 states and 1668 transitions. [2022-02-20 14:39:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1668 transitions. [2022-02-20 14:39:57,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (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,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1667 transitions. [2022-02-20 14:39:57,483 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1667 transitions. Word has length 19 [2022-02-20 14:39:57,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,483 INFO L470 AbstractCegarLoop]: Abstraction has 1317 states and 1667 transitions. [2022-02-20 14:39:57,483 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,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1667 transitions. [2022-02-20 14:39:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:57,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,484 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:57,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 14:39:57,484 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1516697142, now seen corresponding path program 1 times [2022-02-20 14:39:57,485 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283561936] [2022-02-20 14:39:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {28367#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); {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {28367#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_~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_~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;havoc main_~cond~0#1; {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {28367#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {28367#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; {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {28367#true} assume !(0 != main_~p1~0#1); {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {28367#true} assume !(0 != main_~p2~0#1); {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {28367#true} assume !(0 != main_~p3~0#1); {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {28367#true} assume !(0 != main_~p4~0#1); {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {28367#true} assume !(0 != main_~p5~0#1); {28367#true} is VALID [2022-02-20 14:39:57,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {28367#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:57,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:57,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:57,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:57,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:57,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:57,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:57,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {28369#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {28368#false} is VALID [2022-02-20 14:39:57,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {28368#false} assume 0 != main_~p7~0#1; {28368#false} is VALID [2022-02-20 14:39:57,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {28368#false} assume 1 != main_~lk7~0#1; {28368#false} is VALID [2022-02-20 14:39:57,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {28368#false} assume !false; {28368#false} is VALID [2022-02-20 14:39:57,505 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,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283561936] [2022-02-20 14:39:57,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283561936] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413670652] [2022-02-20 14:39:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,506 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:57,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,506 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:57,517 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:57,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,518 INFO L87 Difference]: Start difference. First operand 1317 states and 1667 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:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,672 INFO L93 Difference]: Finished difference Result 1977 states and 2485 transitions. [2022-02-20 14:39:57,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,673 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:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,673 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:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 14:39:57,674 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:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 14:39:57,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-20 14:39:57,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,786 INFO L225 Difference]: With dead ends: 1977 [2022-02-20 14:39:57,786 INFO L226 Difference]: Without dead ends: 1351 [2022-02-20 14:39:57,786 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,787 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 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,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 92 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,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-02-20 14:39:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2022-02-20 14:39:57,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (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,809 INFO L74 IsIncluded]: Start isIncluded. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (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,810 INFO L87 Difference]: Start difference. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (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,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,860 INFO L93 Difference]: Finished difference Result 1351 states and 1668 transitions. [2022-02-20 14:39:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1668 transitions. [2022-02-20 14:39:57,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 0 states have call successors, (0), 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:57,863 INFO L87 Difference]: Start difference. First operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 0 states have call successors, (0), 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:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,911 INFO L93 Difference]: Finished difference Result 1351 states and 1668 transitions. [2022-02-20 14:39:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1668 transitions. [2022-02-20 14:39:57,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (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,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1667 transitions. [2022-02-20 14:39:57,964 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1667 transitions. Word has length 20 [2022-02-20 14:39:57,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,964 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 1667 transitions. [2022-02-20 14:39:57,965 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:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1667 transitions. [2022-02-20 14:39:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:57,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,966 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:57,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 14:39:57,966 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash -815632564, now seen corresponding path program 1 times [2022-02-20 14:39:57,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720020842] [2022-02-20 14:39:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {34566#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); {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {34566#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_~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_~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;havoc main_~cond~0#1; {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {34566#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {34566#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; {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {34566#true} assume !(0 != main_~p1~0#1); {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {34566#true} assume !(0 != main_~p2~0#1); {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {34566#true} assume !(0 != main_~p3~0#1); {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {34566#true} assume !(0 != main_~p4~0#1); {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {34566#true} assume !(0 != main_~p5~0#1); {34566#true} is VALID [2022-02-20 14:39:57,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {34566#true} assume !(0 != main_~p6~0#1); {34566#true} is VALID [2022-02-20 14:39:57,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {34566#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:57,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:57,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:57,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:57,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:57,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:57,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:57,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:57,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {34568#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {34567#false} is VALID [2022-02-20 14:39:57,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {34567#false} assume !false; {34567#false} is VALID [2022-02-20 14:39:57,987 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,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720020842] [2022-02-20 14:39:57,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720020842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845596535] [2022-02-20 14:39:57,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,988 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:57,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,988 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:57,998 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:57,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,998 INFO L87 Difference]: Start difference. First operand 1349 states and 1667 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,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,196 INFO L93 Difference]: Finished difference Result 2183 states and 2660 transitions. [2022-02-20 14:39:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:58,196 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,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:58,197 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,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-20 14:39:58,197 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,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-20 14:39:58,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-02-20 14:39:58,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,365 INFO L225 Difference]: With dead ends: 2183 [2022-02-20 14:39:58,365 INFO L226 Difference]: Without dead ends: 2181 [2022-02-20 14:39:58,366 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,366 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 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,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 78 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,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-02-20 14:39:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2053. [2022-02-20 14:39:58,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:58,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2181 states. Second operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (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,393 INFO L74 IsIncluded]: Start isIncluded. First operand 2181 states. Second operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (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,394 INFO L87 Difference]: Start difference. First operand 2181 states. Second operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (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,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,523 INFO L93 Difference]: Finished difference Result 2181 states and 2595 transitions. [2022-02-20 14:39:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2595 transitions. [2022-02-20 14:39:58,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 0 states have call successors, (0), 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 2181 states. [2022-02-20 14:39:58,528 INFO L87 Difference]: Start difference. First operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 0 states have call successors, (0), 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 2181 states. [2022-02-20 14:39:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,658 INFO L93 Difference]: Finished difference Result 2181 states and 2595 transitions. [2022-02-20 14:39:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2595 transitions. [2022-02-20 14:39:58,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:58,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (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,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2467 transitions. [2022-02-20 14:39:58,782 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2467 transitions. Word has length 20 [2022-02-20 14:39:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:58,782 INFO L470 AbstractCegarLoop]: Abstraction has 2053 states and 2467 transitions. [2022-02-20 14:39:58,782 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,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2467 transitions. [2022-02-20 14:39:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:58,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:58,784 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,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 14:39:58,784 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1208659574, now seen corresponding path program 1 times [2022-02-20 14:39:58,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:58,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680132965] [2022-02-20 14:39:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:58,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {43366#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); {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {43366#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_~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_~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;havoc main_~cond~0#1; {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {43366#true} assume !false;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {43366#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; {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {43366#true} assume !(0 != main_~p1~0#1); {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {43366#true} assume !(0 != main_~p2~0#1); {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {43366#true} assume !(0 != main_~p3~0#1); {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {43366#true} assume !(0 != main_~p4~0#1); {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {43366#true} assume !(0 != main_~p5~0#1); {43366#true} is VALID [2022-02-20 14:39:58,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {43366#true} assume !(0 != main_~p6~0#1); {43366#true} is VALID [2022-02-20 14:39:58,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {43366#true} assume !(0 != main_~p7~0#1); {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:58,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:58,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:58,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:58,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:58,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:58,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:58,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {43368#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {43367#false} is VALID [2022-02-20 14:39:58,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {43367#false} assume 1 != main_~lk7~0#1; {43367#false} is VALID [2022-02-20 14:39:58,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {43367#false} assume !false; {43367#false} is VALID [2022-02-20 14:39:58,804 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,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680132965] [2022-02-20 14:39:58,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680132965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599926226] [2022-02-20 14:39:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,805 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,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,805 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,815 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,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,816 INFO L87 Difference]: Start difference. First operand 2053 states and 2467 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,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,425 INFO L93 Difference]: Finished difference Result 4549 states and 5347 transitions. [2022-02-20 14:39:59,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:59,426 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,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:59,426 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,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 14:39:59,426 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,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-20 14:39:59,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-20 14:39:59,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:59,486 INFO L225 Difference]: With dead ends: 4549 [2022-02-20 14:39:59,486 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:39:59,489 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,490 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 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,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 105 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,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:39:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:39:59,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:59,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,491 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,491 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,491 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:39:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:59,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:39:59,491 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:39:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,491 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:39:59,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:59,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:59,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:39:59,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-02-20 14:39:59,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:59,492 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:39:59,492 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,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:59,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,493 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:39:59,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 14:39:59,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:39:59,502 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,502 INFO L858 garLoopResultBuilder]: For program point L77-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L69-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L861 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L53-2(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L103-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L88-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L861 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-02-20 14:39:59,503 INFO L861 garLoopResultBuilder]: At program point L122(lines 6 123) the Hoare annotation is: true [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L858 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-02-20 14:39:59,503 INFO L854 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-02-20 14:39:59,504 INFO L858 garLoopResultBuilder]: For program point L73-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,504 INFO L858 garLoopResultBuilder]: For program point L98-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L65-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L83-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L108-1(lines 32 118) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-02-20 14:39:59,505 INFO L858 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-02-20 14:39:59,509 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] [2022-02-20 14:39:59,510 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:39:59,513 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:39:59,513 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-02-20 14:39:59,514 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-02-20 14:39:59,515 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-02-20 14:39:59,516 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 14:39:59,516 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 14:39:59,516 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-02-20 14:39:59,516 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2022-02-20 14:39:59,516 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 14:39:59,516 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 14:39:59,516 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:39:59,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:39:59 BoogieIcfgContainer [2022-02-20 14:39:59,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:39:59,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:39:59,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:39:59,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:39:59,533 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:52" (3/4) ... [2022-02-20 14:39:59,535 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:39:59,541 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 14:39:59,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 14:39:59,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:39:59,542 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:39:59,579 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:39:59,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:39:59,580 INFO L158 Benchmark]: Toolchain (without parser) took 7238.38ms. Allocated memory was 123.7MB in the beginning and 195.0MB in the end (delta: 71.3MB). Free memory was 86.8MB in the beginning and 106.5MB in the end (delta: -19.7MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2022-02-20 14:39:59,580 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory was 94.7MB in the beginning and 94.6MB in the end (delta: 22.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:39:59,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.43ms. Allocated memory is still 123.7MB. Free memory was 86.6MB in the beginning and 96.2MB in the end (delta: -9.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 14:39:59,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.60ms. Allocated memory is still 123.7MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:39:59,580 INFO L158 Benchmark]: Boogie Preprocessor took 39.09ms. Allocated memory is still 123.7MB. Free memory was 94.1MB in the beginning and 93.5MB in the end (delta: 674.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:39:59,580 INFO L158 Benchmark]: RCFGBuilder took 341.53ms. Allocated memory is still 123.7MB. Free memory was 93.5MB in the beginning and 78.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 14:39:59,581 INFO L158 Benchmark]: TraceAbstraction took 6578.24ms. Allocated memory was 123.7MB in the beginning and 195.0MB in the end (delta: 71.3MB). Free memory was 78.8MB in the beginning and 109.6MB in the end (delta: -30.8MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2022-02-20 14:39:59,581 INFO L158 Benchmark]: Witness Printer took 46.57ms. Allocated memory is still 195.0MB. Free memory was 109.6MB in the beginning and 106.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 14:39:59,583 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.16ms. Allocated memory is still 123.7MB. Free memory was 94.7MB in the beginning and 94.6MB in the end (delta: 22.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.43ms. Allocated memory is still 123.7MB. Free memory was 86.6MB in the beginning and 96.2MB in the end (delta: -9.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.60ms. Allocated memory is still 123.7MB. Free memory was 96.2MB in the beginning and 94.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.09ms. Allocated memory is still 123.7MB. Free memory was 94.1MB in the beginning and 93.5MB in the end (delta: 674.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 341.53ms. Allocated memory is still 123.7MB. Free memory was 93.5MB in the beginning and 78.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6578.24ms. Allocated memory was 123.7MB in the beginning and 195.0MB in the end (delta: 71.3MB). Free memory was 78.8MB in the beginning and 109.6MB in the end (delta: -30.8MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 46.57ms. Allocated memory is still 195.0MB. Free memory was 109.6MB in the beginning and 106.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: 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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 1857 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 729 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1128 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2053occurred in iteration=18, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 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, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 14:39:59,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE